Improved large-step Markov chain variants for the symmetric TSP

DOI10.1023/A:1009624916728zbMath1071.90556OpenAlexW1546534345MaRDI QIDQ2567843

Inki Hong, Byung-Ro Moon, Andrew B. Kahng

Publication date: 13 October 2005

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009624916728

zbMATH Keywords

optimizationsimulated annealingtraveling salesman problemLarge-step Markov chain

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

Embedded local search approaches for routing optimization ⋮ Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ Match twice and stitch: a new TSP tour construction heuristic. ⋮ Iterated local search for the quadratic assignment problem

This page was built for publication: Improved large-step Markov chain variants for the symmetric TSP