This report describes an enhancement of the Lin-Kernighan-Helsgaun TSP solver (LKH) for fast generation of candidate sets for very-large scale traveling salesman problems. Its implementation is based on a metaheuristic called POPMUSIC. The enhancement makes it possible to generate high-quality candidate sets in almost linear time, even for non-geometric instances.
|Place of Publication||Roskilde|
|Number of pages||13|
|Publication status||Published - 18 Jul 2018|
- Traveling salesman problem
- Candidate set generation