![Institutional Repository [SANDBOX]](images/dias.logo.png "Institutional Repository [SANDBOX]"){kind=logo}
Institutional Repository [SANDBOX]
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/11DA00A5-9C91-4311-92A6-D562F92B7434 | ||
| Year | 2019 | ||
| Type of Item | Conference Full Paper | ||
| License |
|
||
| Bibliographic Citation | 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. https://doi.org/10.1007/978-3-030-38629-0_12 | ||
| Appears in Collections |
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.
Copyright © DIAS 2013
