Large-step markov chains for the TSP incorporating local search heuristics
| Autor: | Edward W. Felten, Olivier C. Martin, Steve W. Otto |
|---|---|
| Rok vydání: | 1992 |
| Předmět: |
Mathematical optimization
Markov chain business.industry Applied Mathematics Management Science and Operations Research Travelling salesman problem Industrial and Manufacturing Engineering Simulated annealing Euclidean traveling salesman problem Combinatorial optimization Local search (optimization) Heuristics business Software MathematicsofComputing_DISCRETEMATHEMATICS Mathematics |
| Zdroj: | Operations Research Letters. 11:219-224 |
| ISSN: | 0167-6377 |
| Popis: | We consider a new class of optimization heuristics which combine local searches with stochastic sampling methods, allowing one to iterate local optimization heuristics. We have tested this on the Euclidean Traveling Salesman Problem, improving 3-opt by over 1.6% and Lin-Kernighan by 1.3%. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|