Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP

2-Opt is probably the most basic local search heuristic for the TSP. This heuristic achieves amazingly good results on “real world” Euclidean instances both with respect to running time and approximation ratio. There are numerous experimental studies on the performance of 2-Opt. However, the theoret...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 68; no. 1; pp. 190 - 264
Main Authors:	Englert, Matthias, Röglin, Heiko, Vöcking, Berthold
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.01.2014 Springer
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Applied sciences Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Exact sciences and technology Flows in networks. Combinatorial problems Mathematics of Computing Operational research and scientific management Operational research. Management science Theory of Computation TSP Probabilistic analysis 2-Opt Local search Probabilistic approach Euclidean theory Worst case method Insertion Travelling salesman problem Probability distribution Experimental study Modeling Upper bound Perturbation method Gaussian process Heuristic method Standard deviation Metric Tour
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!