Computing the shortest route among multiple points without revealing their geographical locations

Authors

  • Ayad Ibrahim Abdulsada Department of Computer Science, College of Education for pure sciences, Basrah University, Basrah,
  • Ali Hussein Rason Department of Mathematics, College of Education for pure sciences, Basrah University, Basrah,
  • Ali A. Yassin Department of Computer Science, College of Education for pure sciences, Basrah University, Basrah,

Keywords:

TSP, privacy preserving location services, great circle distance, genetic algorithms, cryptography.

Abstract

Travelling salesman problem (TSP) represents a classical optimization problem. Its main goal is to find the shortest route when visiting multiple points. However, the state of the art methods are generally assumed that the geographical locations are not private. This reduces the utilization of these methods to work within public environments. Essentially, this assumption limits more practical applications, e.g., the shortest route among military bases, where the geographical locations of such bases are confidential. This paper presents a method for privately computing the shortest route among multiple points on the Earth without compromising the privacy of their locations.

Downloads

Download data is not yet available.

Downloads

Published

2017-08-10

How to Cite

Ibrahim Abdulsada, A., Hussein Rason, A., & A. Yassin, A. (2017). Computing the shortest route among multiple points without revealing their geographical locations. Journal of Al-Qadisiyah for Computer Science and Mathematics, 7(1), 28–40. Retrieved from https://jqcsm.qu.edu.iq/index.php/journalcm/article/view/82

Issue

Vol. 7 No. 1 (2015): JQCM

Section

Math Articles