Journal
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
Volume 32, Issue 3, Pages 231-257Publisher
SPRINGER
DOI: 10.1007/s10589-005-4798-5
Keywords
Traveling Salesman Problem; Greedy Randomized Adaptive Search Procedure; local search; Meta-Heuristics
Ask authors/readers for more resources
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 [18].
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available