Reduced Complexity Divide and Conquer Algorithm for Large Scale TSPs

The Traveling Salesman Problem (TSP) is the problem of finding the shortest path passing through all given cities while only passing by each city once and finishing at the same starting city. This problem has NP-hard complexity making it extremely impractical to get the most optimal path even for problems as small as 20 cities since the number of permutations becomes too high. Many heuristic methods have been devised to reach “good” solutions in reasonable time. In this paper, we present the idea of utilizing a spatial “geographical” Divide and Conquer technique in conjunction with heuristic TSP algorithms specifically the Nearest Neighbor 2-opt algorithm. We have found that the proposed algorithm has lower complexity than algorithms published in the literature. This comes at a lower accuracy expense of around 9%. It is our belief that the presented approach will be welcomed to the community especially for large problems where a reasonable solution could be reached in a fraction of the time.

@article{Darwish2014,
  title     = {Reduced Complexity Divide and Conquer Algorithm for Large Scale TSPs},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {5},
  number    = {1},
  year      = {2014},
  publisher = {The Science and Information Organization},
  author    = {Hoda A. Darwish and Ihab Talkhan},
  doi       = {10.14569/IJACSA.2014.050110},
  url       = {https://doi.org/10.14569/IJACSA.2014.050110}
}