Average-case approximation ratio of the 2-opt algorithm for the TSP

Authors:
Christian Engels;Bodo Manthey
Affiliations:
Saarland University, Department of Computer Science, Postfach 151150, 66041 Saarbrücken, Germany;Saarland University, Department of Computer Science, Postfach 151150, 66041 Saarbrücken, Germany
Venue:
Operations Research Letters
Year:
2009

Citing 2
Cited 2

New Results on the Old k-opt Algorithm for the Traveling Salesman Problem

SIAM Journal on Computing
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

Impact of grafting a 2-opt algorithm based local searcher into the genetic algorithm

AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
Smoothed analysis of partitioning algorithms for Euclidean functionals

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the 2-opt heuristic for the traveling salesman problem achieves an expected approximation ratio of roughly O(n) for instances with n nodes, where the edge weights are drawn uniformly and independently at random.