Expanding neighborhood GRASP for the traveling salesman problem

Expanding neighborhood GRASP for the traveling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor2006616
Country: United Kingdom
Volume: 32
Issue: 3
Start Page Number: 231
End Page Number: 257
Publication Date: Dec 2005
Journal: Computational Optimization and Applications
Authors: , ,
Keywords: heuristics
Abstract:

In this paper, we present the application of a modified version of the well known Greedy Randomized Adaptive Search Procedure (GRASP) to the TSP. The proposed GRASP algorithm has two phases: In the first phase the algorithm finds an initial solution of the problem and in the second phase a local search procedure is utilized for the improvement of the initial solution. The local search procedure employs two different local search strategies based on 2-opt and 3-opt methods. The algorithm was tested on numerous benchmark problems from TSPLIB. The results were very satisfactory and for the majority of the instances the results were equal to the best known solution. The algorithm is also compared to the algorithms presented and tested in the DIMACS Implementation Challenge that was organized by David Johnson.

Reviews

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