Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
EN  |  EL

Αναζήτηση

Πλοήγηση

Ο Χώρος μου

Expanding neighborhood GRASP for the traveling salesman problem

Marinakis Ioannis, Migdalas, Athanasios, Pardalos Vasileios

Απλή Εγγραφή

URIhttp://purl.tuc.gr/dl/dias/92BDF641-0623-4F3D-9B7F-CF5E79F4B753-
Αναγνωριστικόhttps://doi.org/10.1007/s10589-005-4798-5-
Γλώσσαen-
Μέγεθος27 pagesen
ΤίτλοςExpanding neighborhood GRASP for the traveling salesman problemen
ΔημιουργόςMarinakis Ioannisen
ΔημιουργόςΜαρινακης Ιωαννηςel
ΔημιουργόςMigdalas, Athanasiosen
ΔημιουργόςPardalos Vasileiosen
ΔημιουργόςΠαρδαλος Βασιλειοςel
ΕκδότηςKluweren
Περίληψη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.en
ΤύποςPeer-Reviewed Journal Publicationen
ΤύποςΔημοσίευση σε Περιοδικό με Κριτέςel
Άδεια Χρήσηςhttp://creativecommons.org/licenses/by/4.0/en
Ημερομηνία2015-11-05-
Ημερομηνία Δημοσίευσης2005-
Θεματική ΚατηγορίαGreedy Randomized Adaptive Search Procedureen
Βιβλιογραφική ΑναφοράY. 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

Υπηρεσίες

Στατιστικά

 

Copyright © DIAS 2013