Abstract
The well-known switching algorithm proposed by Lin and Kernighan for the Euclidean Travelling Salesman Problem has proved to be a simple efficient algorithm for medium size problems (though it often gets trapped in local optima). Although its complexity status is still open, it has been observed to be polynomially bounded in practice, when applied to uniformly distributed points in the unit square. In this paper this polynomial behaviour is derived theoretically. (However, we will come up with a bound of O(n 18) with probability 1 −c/n, whereas in practice the algorithm works slightly better.)
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Bonomi and J.L. Lutton, “Then-city travelling salesman problem: Statistical mechanics and the metropolis algorithm,”SIAM Review 26 (1984) 551–568.
R.M. Karp, “The probabilistic analysis of some combinatorial search algorithms,” in: J. F. Traub, ed.,Algorithms and Complexity (Academic Press, New York, 1976).
S. Lin, B.W. Kernighan, “An effective heuristic algorithm for the travelling salesman problem,”Operations Research 21 (1973) 498–516.
E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys,The Traveling Salesman Problem (John Wiley, Chichester 1985).
Th.M. Liebling, Y. Rossier and M. Troyon, “Probabilistic exchange algorithms and euclidean travelling salesman problems,” RO851125, Department of Mathematics EPF Lausanne, Switzerland (1985).
C.M. Papadimitriou and K. Steiglitz, “Some examples of difficult traveling salesman problems,”Operations Research 26 (1978) 434–443.
C.A. Tovey, “On the number of iterations of local improvement algorithms,”Operations Research Letters 2 (1983) 231–238.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kern, W. A probabilistic analysis of the switching algorithm for the euclidean TSP. Mathematical Programming 44, 213–219 (1989). https://doi.org/10.1007/BF01587089
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01587089