![Ιδρυματικό Αποθετήριο [SANDBOX]](images/dias.logo.png "Ιδρυματικό Αποθετήριο [SANDBOX]"){kind=logo}
Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/A3866ECD-C8D8-466C-B369-E5D47A983799 | ||
| Έτος | 2019 | ||
| Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | ||
| Άδεια Χρήσης |
|
||
| Βιβλιογραφική Αναφορά | D. Trachanatzi, M. Rigakis, A. Taxidou, M. Marinaki, Y. Marinakis, and N. Matsatsinis, “A novel solution encoding in the Differential Evolution algorithm for optimizing tourist trip design problems,” 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. 253–267, doi: 10.1007/978-3-030-38629-0_21. https://doi.org/10.1007/978-3-030-38629-0_21 | ||
| Εμφανίζεται στις Συλλογές |
In this paper, a tourist trip design problem is simulated by the Capacitated Team Orienteering Problem (CTOP). The objective of the CTOP is to form feasible solution, as a set of itineraries, that represent a sequence visit of nodes, that maximize the total prize collected from them. Each itinerary is constrained by the vehicle capacity and the total travelled time. The proposed algorithmic framework, the Distance Related Differential Algorithm (DRDE), is a combination of the widely-known Differential Evolution algorithm (DE) and a novel encoding/decoding process, namely the Distance Related (DR). The process is based on the representation of the solution vector by the Euclidean Distance of the included nodes and offers a data-oriented approach to apply the original DE to a discrete optimization problem, such as the CTOP. The efficiency of the proposed algorithm is demonstrated over computational experiments.
Copyright © DIAS 2013
