MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Analyzing the run-time behaviour of iterated local search for the TSP (1999) [2 citations — 2 self]

by Thomas Stutzle ,  Holger H. Hoos
III Metaheuristics International Conference
Add To MetaCart

Abstract:

Metaheuristics strongly involve random decisions made during the search process. Because of their nondeterministic nature, the run-time needed by such an algorithm to achieve a specific goal--- like finding an optimal solution to a given problem instance--- is a random variable. Obviously,

Citations

7271 Computers and Intractability - A Guide to the Theory of NP-Completeness – Garey, Johnson - 1979
258 The Traveling Salesman Problem – Lawler, Lenstra, et al. - 1985
236 An effective heuristic algorithm for the traveling salesman problem – Lin, Kernighan - 1973
208 The traveling salesman problem: A case study in local optimization – Johnson, McGeoch - 1996
129 Local Optimization and the Traveling Salesman Problem – Johnson - 1990
128 The Traveling Salesman: Computational Solutions for TSP Applications – Reinelt - 1994
112 Fast algorithms for geometric traveling salesman problems – Bentley - 1992
109 Variable neighborhood search – Mladenović, Hansen - 1997
78 Large-step Markov chains for the traveling salesman problem – Martin, Otto, et al. - 1991
75 An introduction to variable neighborhood search – Hansen, Mladenović - 1998
73 Combining simulated annealing with local search heuristics – Martin, Otto - 1996
59 Genetic Local Search for the TSP: New Results – Merz, Freisleben - 1997
49 Evaluating Las Vegas algorithms — pitfalls and remedies – Hoos, Stützle - 1998
48 Local Search Algorithms for Combinatorial Problems - Analysis, Algorithms, and New Applications – Stützle - 1998
48 Fitness landscapes and memetic algorithm design – Merz, Freisleben - 1999
36 Models for Iterative Global Optimization – Boese - 1996
33 T.: Characterising the behaviour of stochastic local search – Hoos, Stützle - 1999
33 Near-optimal intraprocedural branch alignment – Young, Johnson, et al. - 1997
20 Partitioning of unstructured meshes for load balancing. Concurrency: Practice and Experience – Martin, Otto - 1995
19 Iterated descent: A better algorithm for local search in combinatorial optimization problems – Baum - 1986
15 Iterated Local Search Approach using Genetic Transformation to the Traveling Salesman Problem – Katayama, Narihisa - 1999
14 Repair and brood selection in the traveling salesman problem – Walters - 1998
9 Combinatorial Optimization by Iterative Partial Transcription – Möbius, Freisleben, et al. - 1999
8 Use of Representative Operation Counts in Computational Testing of Algorithms – Ahuja, Orlin - 1996
6 Variable Neighbourhood Search for the p-Median – Hansen, Mladenovi'c - 1997
4 Parallele Heuristiken fur sehr groe Traveling Salesman Probleme – Rohe - 1997
View or Download | Add to My Collection | Correct Errors