Hostname: page-component-cb9f654ff-r5d9c Total loading time: 0 Render date: 2025-08-21T19:33:18.405Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Nearest-Neighbor Algorithm for the Mean-Field Traveling Salesman Problem

Part of: Special processes Algorithms - Computer Science Graph theory Theory of computing

Published online by Cambridge University Press:  30 January 2018

Antar Bandyopadhyay  and
Farkhondeh Sajadi
Antar Bandyopadhyay*
Affiliation:
Indian Statistical Institute, Delhi and Kolkata
Farkhondeh Sajadi*
Affiliation:
Indian Statistical Institute, Delhi
*
∗ Postal address: Theoretical Statistics and Mathematics Unit, Indian Statistical Institute, Delhi Centre, 7 S. J. S. Sansanwal Marg, New Delhi, 110016, India.
∗ Postal address: Theoretical Statistics and Mathematics Unit, Indian Statistical Institute, Delhi Centre, 7 S. J. S. Sansanwal Marg, New Delhi, 110016, India.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this work we consider the mean-field traveling salesman problem, where the intercity distances are taken to be independent and identically distributed with some distribution F. We consider the simplest approximation algorithm, namely, the nearest-neighbor algorithm, where the rule is to move to the nearest nonvisited city. We show that the limiting behavior of the total length of the nearest-neighbor tour depends on the scaling properties of the density of F at 0 and derive the limits for all possible cases of general F.

Keywords

Nearest-neighbor algorithmmean-field setuptraveling salesman problem

MSC classification

Primary: 60K37: Processes in random environments
Secondary: 05C85: Graph algorithms 68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) 68W25: Approximation algorithms

Information

Type
Research Article
Information
Journal of Applied Probability , Volume 51 , Issue 1 , March 2014 , pp. 106 - 117
Copyright
© Applied Probability Trust 

References

Bellmore, M. and Nemhauser, G. L. (1968). The traveling salesman problem: a survey. Operat. Res. 16, 538–558.CrossRefGoogle Scholar
DasGupta, A. (2011). Probability for Statistics and Machine Learning. Springer, New York.Google Scholar
Gavett, J. W. (1965). Three heuristic rules for sequencing Jobs to a single production facility. Manag. Sci. 11, B-166–B-176.Google Scholar
Papadimitriou, C. H. and Steiglitz, K. (1998). Combinatorial Optimization: Algorithms and Complexity. Dover, Mineola, NY.Google Scholar
Rosenkrantz, D. J., Stearns, R. E. and Lewis, P. M. II, (1977). An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6, 563–581.CrossRefGoogle Scholar
Vannimenus, J. and Mézard, M. (1984). On the statistical mechanics of optimization problems of the travelling salesman type. J. Physique Lett. 45, 1145–1153.CrossRefGoogle Scholar
Wästlund, J. (2012). Replica symmetry of the minimum matching. Ann. Math. 175, 1061–1091.CrossRefGoogle Scholar
Wästlund, J. (2010). The mean field traveling salesman and related problems. Acta Math. 204, 91–150.Google Scholar
Wendel, J. G. (1948). Note on the gamma function. Amer. Math. Monthly 55, 563–564.CrossRefGoogle Scholar