Institutional Repository [SANDBOX]
Technical University of Crete
EN  |  EL

Search

Browse

My Space

Expanding neighborhood GRASP for the traveling salesman problem

Marinakis Ioannis, Migdalas, Athanasios, Pardalos Vasileios

Simple record

URIhttp://purl.tuc.gr/dl/dias/92BDF641-0623-4F3D-9B7F-CF5E79F4B753-
Identifierhttps://doi.org/10.1007/s10589-005-4798-5-
Languageen-
Extent27 pagesen
TitleExpanding neighborhood GRASP for the traveling salesman problemen
CreatorMarinakis Ioannisen
CreatorΜαρινακης Ιωαννηςel
CreatorMigdalas, Athanasiosen
CreatorPardalos Vasileiosen
CreatorΠαρδαλος Βασιλειοςel
PublisherKluweren
Content SummaryIn 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.en
Type of ItemPeer-Reviewed Journal Publicationen
Type of ItemΔημοσίευση σε Περιοδικό με Κριτέςel
Licensehttp://creativecommons.org/licenses/by/4.0/en
Date of Item2015-11-05-
Date of Publication2005-
SubjectGreedy Randomized Adaptive Search Procedureen
Bibliographic CitationY. Marinakis, A. Migdalas ,P.M. Pardalos, "Expanding neighborhood GRASP for the traveling salesman problem, Comp.Optimization and Appl.,vol. 32,no.3,pp. 231-257,Dec. 2005.doi:10.1007/s10589-005-4798-5en

Services

Statistics

 

Copyright © DIAS 2013