The complexity of the Lin-Kernighan heuristic for the traveling salesman problem
SIAM Journal on Computing
Efficient cluster compensation for lin-kernighan heuristics
Efficient cluster compensation for lin-kernighan heuristics
Chained Lin-Kernighan for Large Traveling Salesman Problems
INFORMS Journal on Computing
Tunneling between optima: partition crossover for the traveling salesman problem
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Hi-index | 0.00 |
Multi-trial Lin-Kernighan-Helsgaun 2 (LKH-2) is widely considered to be the best Interated Local Search heuristic for the Traveling Salesman Problem (TSP) and has found the best-known solutions to a large number of benchmark problems. Although LKH-2 performs exceptionally well on most instances, it is known to have difficulty on clustered instances of the TSP. Generalized Partition Crossover (GPX) is a crossover operator for the TSP that efficiently constructs new solutions by partitioning a graph constructed from the union of two solutions. We show that GPX is especially well-suited for clustered instances and evaluate its ability to improve solutions found by LKH-2. We present two methods of combining GPX with multi-trial LKH-2. We find that combining GPX with LKH-2 dramatically improves the evaluation of solutions found by LKH-2 alone on clustered instances with sizes ranging from 3,000 to 30,000 cities.