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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 68; číslo 1; s. 190 - 264
Hlavní autoři:	Englert, Matthias, Röglin, Heiko, Vöcking, Berthold
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.01.2014 Springer
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!