- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
Computing the shortest route amongmultiple points without revealing theirgeographical locations | ||
| Journal of Al-Qadisiyah for Computer Science and Mathematics | ||
| Article 1, Volume 7, Issue 1, 2015, Pages 28-40 PDF (0 K) | ||
| Author | ||
| Ayad Ibrahim Abdulsada Ali Hussein Rason Ali A. Yassin | ||
| 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. | ||
| Keywords | ||
| Tsp; privacy preserving location services; great circle distance; Genetic algorithms; Cryptography | ||
|
Statistics Article View: 106 PDF Download: 62 |
||