![Ιδρυματικό Αποθετήριο [SANDBOX]](images/dias.logo.png "Ιδρυματικό Αποθετήριο [SANDBOX]"){kind=logo}
Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/7845A8E4-9D1E-4615-9CF6-EE975D1A2C63 | - |
| Αναγνωριστικό | https://doi.org/10.1007/s10878-005-4921-7 | - |
| Γλώσσα | en | - |
| Μέγεθος | 16 pages | en |
| Τίτλος | A hybrid genetic - GRASP algorithm using lagrangean relaxation for the traveling salesman problem | en |
| Δημιουργός | Marinakis Ioannis | en |
| Δημιουργός | Μαρινακης Ιωαννης | el |
| Δημιουργός | Pardalos, P. M | en |
| Δημιουργός | Migdalas, Athanasios | en |
| Εκδότης | Kluwer | en |
| Περίληψη | Hybridization techniques are very effective for the solution of combinatorial optimization problems. This paper presents a genetic algorithm based on Expanding Neighborhood Search technique (Marinakis, Migdalas, and Pardalos, Computational Optimization and Applications, 2004) for the solution of the traveling salesman problem: The initial population of the algorithm is created not entirely at random but rather using a modified version of the Greedy Randomized Adaptive Search Procedure. Farther more a stopping criterion based on Lagrangean Relaxation is proposed. The combination of these different techniques produces high quality solutions. The proposed algorithm was tested on numerous benchmark problems from TSPLIB with very satisfactory results. Comparisons with the algorithms of the DIMACS Implementation Challenge are also presented. | en |
| Τύπος | Peer-Reviewed Journal Publication | en |
| Τύπος | Δημοσίευση σε Περιοδικό με Κριτές | el |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
| Ημερομηνία | 2015-11-05 | - |
| Ημερομηνία Δημοσίευσης | 2005 | - |
| Θεματική Κατηγορία | Traveling salesman problem | en |
| Θεματική Κατηγορία | Genetic algorithms | en |
| Βιβλιογραφική Αναφορά | Y. Marinakis, A. Migdalas , P.M. Pardalos, "A hybrid genetic - GRASP algorithm using lagrangean relaxation for the traveling salesman problem, J. of Comb.Optimization, vol. 10,no.4, pp.311-326,Dec. 2005.doi :10.1007/s10878-005-4921-7 | en |
Copyright © DIAS 2013
