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

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

0.00 Avg rating0 Votes
Article ID: iaor1993800
Country: Netherlands
Volume: 11
Issue: 4
Start Page Number: 219
End Page Number: 224
Publication Date: May 1992
Journal: Operations Research Letters
Authors: , ,
Keywords: heuristics, markov processes
Abstract:

The authors consider a new class of optimization heuristics which combine local searches with stochastic sampling methods, allowing one to iterate local optimization heuristics. They have tested this on the Euclidean Traveling Salesman Problem, improving 3-opt by over 1.6% and Lin-Kernighan by 1.3%.

Reviews

Required fields are marked *. Your email address will not be published.