Expanding neighborhood GRASP for the traveling salesman problemExpanding neighborhood GRASP for the traveling salesman problem Peer-Reviewed Journal Publication Δημοσίευση σε Περιοδικό με Κριτές 2015-11-052005enIn 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.http://creativecommons.org/licenses/by/4.0/Computational Optimization and Applications332231-257 Marinakis Ioannis Μαρινακης Ιωαννης Migdalas, Athanasios Pardalos Vasileios Παρδαλος Βασιλειος Kluwer Greedy Randomized Adaptive Search Procedure