Large-step markov chains for the TSP incorporating local search heuristics

Authors:
Olivier Martin;Steve W Otto;Edward W Felten
Affiliations:
Department of Physics, City College of the City University of New York, New York, NY, USA;Department of Computer Science and Engineering, Oregon Graduate Institute of Science and Technology, Beaverton, OR, USA;Department of Computer Science, University of Washington, Seattle, WA, USA
Venue:
Operations Research Letters
Year:
1992

Citing 4
Cited 7

Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
Local Optimization and the Traveling Salesman Problem

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Optimization of a 532-city symmetric traveling salesman problem by branch and cut

Operations Research Letters

Match twice and stitch: a new TSP tour construction heuristic

Operations Research Letters
Local optima networks and the performance of iterated local search

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Vehicle routing and adaptive iterated local search within the hyflex hyper-heuristic framework

LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem

Proceedings of the 15th annual conference on Genetic and evolutionary computation
Multi-robot repeated area coverage

Autonomous Robots
Dealing with hardware heterogeneity: a new parallel search model

Natural Computing: an international journal
A backbone based TSP heuristic for large instances

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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