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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Appligate, D.L., Bixby, R.E., Chavatal, V., Cook, W.J.: The Travelling Salesman Problem, A Computational Study. Princeton Univesity Press, Princeton (2006)
Davendra, D.: Travelling Salesman Problem, Theory and Applications. InTech (2010)
Gutin, G., Punnen, A. (eds.): The Traveling Salesman Problem and Its Variations. Combinatorial Optimization, vol. 12. Kluwer, Dordrecht (2002)
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)
Johnson, D., Papadimitriou, C.: Performance guarantees for heuristics. In: Lawler, et al. (eds.), ch. 5, pp. 145–180 (1985)
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)
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)
Lenstra, J., Kan, A.R.: Some simple applications of the travelling salesman problem. Operational Research Quarterly 26(4), 717–733 (1975)
Lenstra, J.K.: Clustering a Data Array and the Traveling-Salesman Problem. Operations Research 22(2), 413–414 (1974)
Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21(2), 498–516 (1973)
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)
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)
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)
Punnen, A.: The Traveling Salesman Problem: Applications, Formulations and Variations. In: Gutin, Punnen (eds.), ch. 1, pp. 1–28 (2002)
Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Springer, Germany (1994)
Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M.: An Analysis of SeveralHeuristicsfortheTravellingSalesman Problem. SIAM J. Comput. 6, 563–581 (6.1)
http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/tsp/
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Kizilateş, G., Nuriyeva, F. (2013). On the Nearest Neighbor Algorithms for the Traveling Salesman Problem. In: Nagamalai, D., Kumar, A., Annamalai, A. (eds) Advances in Computational Science, Engineering and Information Technology. Advances in Intelligent Systems and Computing, vol 225. Springer, Heidelberg. https://doi.org/10.1007/978-3-319-00951-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-00951-3_11
Publisher Name: Springer, Heidelberg
Print ISBN: 978-3-319-00950-6
Online ISBN: 978-3-319-00951-3
eBook Packages: EngineeringEngineering (R0)