Perturbation: An efficient technique for the solution of very large instances of the Euclidean TSP

Perturbation: An efficient technique for the solution of very large instances of the Euclidean TSP

0.00 Avg rating0 Votes
Article ID: iaor19972161
Country: United States
Volume: 8
Issue: 2
Start Page Number: 125
End Page Number: 133
Publication Date: Apr 1996
Journal: INFORMS Journal On Computing
Authors: , , ,
Abstract:

In this paper the authors introduce a technique for developing efficient iterated local search procedures and they apply it to solve very large instances of the Euclidean Traveling Salesman Problem (TSP). This technique, which the authors call perturbation, uses global information on TSP instances to speed-up the computation and to improve the quality of the tours found by heuristic methods. The main idea is to escape from local optima by introducing perturbations in the problem instance rather than in the solution. The performance of the present algorithms has been tested and compared with known methods. To this end, the authors have executed a number of experiments both on available benchmarks, for which the optimal tour length is known, and on randomly generated instances, for which the comparison is done with the Held-Karp lower bound. The experimental results, performed on up to 100,000 cities, show that the present algorithms outperform the known methods for iterating local search for very large instances.

Reviews

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