Abstract
We present a theoretical average-case analysis of a 2-opt algorithm for the traveling salesman problem. First, we give a model which allows us to compute the required number of steps and the distribution of final solutions found by a best improvement algorithm. This model is empirically validated for a restricted version of the 2-opt neighborhood. Secondly, we present a semi-empirical analysis of the average-case performance of an iterated 2-opt and Lin-Kernighan algorithm based on empirically obtained parameters.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aarts, E.H.L., and J.K. Lenstra (eds.) [1995], Local Search in Combinatorial Optimization, Wiley.
Boese, K.D., A.B. Kahng, and S. Muddu [1994], A new adaptive multi-start technique for combinatorial global optimization, Operations Research Letters 16, 101–113.
Chandra, B., H. Karloff, and C. Tovey [1994], New results on the old k-opt algorithm for the TSP, Proc. of the 5th annual ACM SIAM Symposium on Discrete Algorithms, 150–159.
Croes, G. A. [1958], A method for solving traveling salesman problems, Operations Research 6, 791–812.
Johnson, D.S. [1990], Local optimization and the traveling salesman problem, Proc. 17th Colloquium on Automata, Languages, and Programming, LNCS 447, 446–461.
Johnson, D.S., C.H. Papadimitriou, and M. Yannakakis [1988], How easy is local search?, Journal of Computer and System Sciences 37, 79–100.
Kern, W. [1989], A probabilistic analysis of the switching algorithm for the Euclidian TSP, Mathematical Programming 44, 213–219.
Kirkpatrick, S., and G. Toulouse [1985], Configuration space analysis of Travelling Salesman Problems, Journal Physique 46, 1277–1292.
Martin, O., S.W. Otto, and E.W. Felten [1991], Large-steps markov chains for the travelling salesman problem, Complex Systems 5, 299–326.
Papoulis, A. [1965], Probability Random Variables, and Stochastic Processes, McGraw-Hill.
Stadler, P.F., and W. Schnabl [1992], The landscape of the traveling salesman problem, Physics Letters A 161, 337–344.
Stuart, A., and J.K. Ord [1987], Kendall’s Advanced Theory of Statistics, vol 1: distribution theory, Griffin & Company.
Tong, Y.L. [1990], The Multivariate Normal Distribution, Springer-Verlag.
Tovey, C.A. [1985], Hill climbing with multiple local optima, SIAM Journal of Discrete Mathematics 6, 383–393.
Vossen, T.W.M., M.G.A. Verhoeven, H.M.M. ten Eikelder, and E.H.L. Aarts [1995], A quantitative analysis of iterated local search, Computing Science Report 95–06, Eindhoven University of Technology, Netherlands.
Weinberger, E.D. [1991], Local properties of Kauffman’s N-k model: A tunably rugged energy landscape, Physical Review A 44, 6399–6413.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
ten Eikelder, H.M.M., Verhoeven, M.G.A., Vossen, T.W.M., Aarts, E.H.L. (1996). A Probabilistic Analysis of Local Search. In: Osman, I.H., Kelly, J.P. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1361-8_36
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1361-8_36
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8587-8
Online ISBN: 978-1-4613-1361-8
eBook Packages: Springer Book Archive