On the Nearest Neighbor Algorithms for the Traveling Salesman Problem

Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 225)

Abstract

In this study, a modification of the nearest neighbor algorithm (NND) for the traveling salesman problem (TSP) is researched. NN and NND algorithms are applied to different instances starting with each of the vertices, then the performance of the algorithm according to each vertex is examined. NNDG algorithm which is a hybrid of NND algorithm and Greedy algorithm is proposed considering experimental results, and it is tested on different library instances.

Keywords

traveling salesman problem hybrid algorithm nearest neighbor algorithm greedy algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Appligate, D.L., Bixby, R.E., Chavatal, V., Cook, W.J.: The Travelling Salesman Problem, A Computational Study. Princeton Univesity Press, Princeton (2006)Google Scholar
  2. 2.
    Davendra, D.: Travelling Salesman Problem, Theory and Applications. InTech (2010)Google Scholar
  3. 3.
    Gutin, G., Punnen, A. (eds.): The Traveling Salesman Problem and Its Variations. Combinatorial Optimization, vol. 12. Kluwer, Dordrecht (2002)MATHGoogle Scholar
  4. 4.
    Hubert, L.J., Baker, F.B.: Applications of Combinatorial Programming to Data Analysis: The Traveling Salesman and Related Problems. Psychometrika 43(1), 81–91 (1978)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Johnson, D., Papadimitriou, C.: Performance guarantees for heuristics. In: Lawler, et al. (eds.), ch. 5, pp. 145–180 (1985)Google Scholar
  6. 6.
    Johnson, D.S., McGeoch, L.A.: The Traveling Salesman Problem: A Case Study, Local Search in Combinatorial Optimization, pp. 215–310. John Wiley & Sons (1997)Google Scholar
  7. 7.
    Lawler, E.L., Lenstra, J.K., Rinnoy Kan, A.H.G., Shmoys, D.B.: The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons (1986)Google Scholar
  8. 8.
    Lenstra, J., Kan, A.R.: Some simple applications of the travelling salesman problem. Operational Research Quarterly 26(4), 717–733 (1975)MATHCrossRefGoogle Scholar
  9. 9.
    Lenstra, J.K.: Clustering a Data Array and the Traveling-Salesman Problem. Operations Research 22(2), 413–414 (1974)MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21(2), 498–516 (1973)MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Nuriyeva, F.: New heuristic algorithms for travelling salesman problem. In: 25th Conference of European Chapter on Combinatorial Optimization (ECCO XXV), Antalya, Turkey, April 26-28 (2012)Google Scholar
  12. 12.
    Nuriyeva, F., Kizilates, G., Berberler, M.E.: Experimental Analysis of New Heuristics for the TSP. In: IV International Conference “Problems of Cybernetics and Informatics, Baku, Azerbaijan, September 12-14 (2012)Google Scholar
  13. 13.
    Nuriyeva, F., Kızılateş, G.: A New Hyperheuristic Algorithm for Solving Traveling Salesman Problem. In: 2nd World Conference on Soft Computing, Baku, Azerbaijan, December 3-5, pp. 528–531 (2012)Google Scholar
  14. 14.
    Punnen, A.: The Traveling Salesman Problem: Applications, Formulations and Variations. In: Gutin, Punnen (eds.), ch. 1, pp. 1–28 (2002)Google Scholar
  15. 15.
    Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Springer, Germany (1994)Google Scholar
  16. 16.
    Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M.: An Analysis of SeveralHeuristicsfortheTravellingSalesman Problem. SIAM J. Comput. 6, 563–581 (6.1)Google Scholar
  17. 17.
  18. 18.

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  1. 1.Department of Mathematics, Faculty of ScienceEge UniversityIzmirTurkey

Personalised recommendations