Journal
LEARNING AND INTELLIGENT OPTIMIZATION, LION
Volume 11968, Issue -, Pages 253-267Publisher
SPRINGER INTERNATIONAL PUBLISHING AG
DOI: 10.1007/978-3-030-38629-0_21
Keywords
Capacitated Team Orienteering Problem; Differential Evolution Algorithm; DR solution encoding
Categories
Funding
- European Union (European Social Fund-ESF) through the Operational Programme Human Resources Development, Education and Lifelong Learning [MIS-5000432]
- State Scholarships Foundation (IKY)
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available