Iterated Local Optimization for Minimum Energy Broadcast
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Expanding Neighborhood GRASP for the Traveling Salesman Problem
Computational Optimization and Applications
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
Computers and Operations Research
Two-Stage Ant Colony Optimization for Solving the Traveling Salesman Problem
IWINAC '07 Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II
An Iterated Local Search Approach for Finding Provably Good Solutions for Very Large TSP Instances
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Multiagent optimization system for solving the traveling salesman problem (TSP)
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
Computers and Operations Research
Reducing the size of traveling salesman problem instances by fixing edges
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Improving the efficiency of Helsgaun's Lin-Kernighan Heuristic for the symmetric TSP
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Approximate backbone based multilevel algorithm for next release problem
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
Multilevel variable neighborhood search for periodic routing problems
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
A multilevel memetic algorithm for large sat-encoded problems
Evolutionary Computation
A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem
INFORMS Journal on Computing
A backbone based TSP heuristic for large instances
Journal of Heuristics
| Hi-index | 0.00 |
We motivate, derive, and implement a multilevel approach to the travelling salesman problem. The resulting algorithm progressively coarsens the problem, initialises a tour, and then employs either the Lin-Kernighan (LK) or the Chained Lin-Kernighan (CLK) algorithm to refine the solution on each of the coarsened problems in reverse order. In experiments on a well-established test suite of 80 problem instances we found multilevel configurations that either improved the tour quality by over 25% as compared to the standard CLK algorithm using the same amount of execution time, or that achieved approximately the same tour quality over seven times more rapidly. Moreover, the multilevel variants seem to optimise far better the more clustered instances with which the LK and CLK algorithms have the most difficulties.