![Ιδρυματικό Αποθετήριο [SANDBOX]](images/dias.logo.png "Ιδρυματικό Αποθετήριο [SANDBOX]"){kind=logo}
Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/11DA00A5-9C91-4311-92A6-D562F92B7434 | - |
| Αναγνωριστικό | https://doi.org/10.1007/978-3-030-38629-0_12 | - |
| Αναγνωριστικό | https://link.springer.com/chapter/10.1007/978-3-030-38629-0_12 | - |
| Γλώσσα | en | - |
| Μέγεθος | 11 pages | en |
| Τίτλος | A hybrid variation Harmony Search algorithm for the Team Orienteering Problem with capacity limitations | en |
| Δημιουργός | Tsakirakis Eleftherios | en |
| Δημιουργός | Τσακιρακης Ελευθεριος | el |
| Δημιουργός | Marinaki Magdalini | en |
| Δημιουργός | Μαρινακη Μαγδαληνη | el |
| Δημιουργός | Marinakis Ioannis | en |
| Δημιουργός | Μαρινακης Ιωαννης | el |
| Εκδότης | Springer Nature | en |
| Περίληψη | This paper addresses a new optimization method for a variant of the category of orienteering problems (OP), which is well-known as the capacitated team orienteering problem (CTOP). The main objective of CTOP focuses on the maximization of the total collected profit from a set of candidate nodes or customers by taking into account the limitations of vehicle capacity and time upper boundary of a constructed route. To solve CTOP, we present a new optimization algorithm called the Similarity Hybrid Harmony Search. This methodology includes an innovative “similarity process” technique, which takes advantage the most profitable nodes/customers during the algorithmic procedure aiming to extend the diversification in the solution area. The experimental tests were conducted in the most popular set of instances and the obtained results are compared with most competitive algorithms in the literature. | en |
| Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | el |
| Τύπος | Conference Full Paper | en |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
| Ημερομηνία | 2022-05-17 | - |
| Ημερομηνία Δημοσίευσης | 2019 | - |
| Θεματική Κατηγορία | Capacitated Team Orienteering Problem | en |
| Θεματική Κατηγορία | Harmony Search algorithm | en |
| Θεματική Κατηγορία | Vehicle routing problems with profits | en |
| Βιβλιογραφική Αναφορά | E. Tsakirakis, M. Marinaki, and Y. Marinakis, “A hybrid variation Harmony Search algorithm for the Team Orienteering Problem with capacity limitations,” in Learning and Intelligent Optimization, vol 11968, Lecture Notes in Computer Science, N. Matsatsinis, Y. Marinakis, P. Pardalos, Eds., Cham, Switzerland: Springer Nature, 2020, pp. 146–156, doi: 10.1007/978-3-030-38629-0_12. | en |
Copyright © DIAS 2013
