URI | http://purl.tuc.gr/dl/dias/31B407E4-43C9-4499-81AB-8E35124A4212 | - |
Αναγνωριστικό | https://doi.org/10.1007/978-3-319-18167-7_10 | - |
Γλώσσα | en | - |
Μέγεθος | 12 pages | en |
Τίτλος | A memetic-GRASP algorithm for the solution of the orienteering problem
| en |
Δημιουργός | Matsatsinis Nikolaos | en |
Δημιουργός | Ματσατσινης Νικολαος | el |
Δημιουργός | Marinakis Ioannis | en |
Δημιουργός | Μαρινακης Ιωαννης | el |
Δημιουργός | Michael Politis | en |
Δημιουργός | Marinaki Magdalini | en |
Δημιουργός | Μαρινακη Μαγδαληνη | el |
Εκδότης | Springer Verlag | en |
Περίληψη | The last decade a large number of applications in logistics, tourism and other fields have been studied and modeled as Orienteering Problems (OPs). In the orienteering problem, a standard amount of nodes are given, each with a specific score. The goal is to determine a path, limited in length, from the start point to the end point through a subset of locations in order to maximize the total path score. In this paper, we present a new hybrid evolutionary algorithm for the solution of the Orienteering Problem. The algorithm combines a Greedy Randomized Adaptive Search Procedure (GRASP), an Evolutionary Algorithm and two local search procedures. The algorithm was tested in a number of benchmark instances from the literature and in most of them the best known solutions were found. | en |
Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | el |
Τύπος | Conference Full Paper | en |
Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
Ημερομηνία | 2015-11-04 | - |
Ημερομηνία Δημοσίευσης | 2015 | - |
Θεματική Κατηγορία | Memetic Algorithm | en |
Θεματική Κατηγορία | Orienteering Problem | en |
Βιβλιογραφική Αναφορά | Y. Marinakis, M. Politis, M. Marinaki, N. Matsatsinis ,"A memetic-GRASP algorithm for the solution of the orienteering problem," in 2015 3rd Intern. Conf. on Modelling, Comp. and Optimization in Inform. Systems and Manag. Sciences (MCO),pp. 105-116.doi:10.1007/978-3-319-18167-7_10 | en |