1929. Optimization of Tourist Trip Routes with the Clustered Team Orienteering Problem
Invited abstract in session WC-58: Team Orienteering Problems, stream Vehicle Routing and Logistics.
Wednesday, 12:30-14:00Room: Liberty 1.13
Authors (first author is the speaker)
| 1. | Elçin Kayacı
|
| Industrial Engineering, Başkent University | |
| 2. | Tusan Derya
|
| Industrial Engineering, Başkent University | |
| 3. | Kumru ATALAY
|
| Industrial Engineering, Başkent University |
Abstract
Tourist trip planning is an optimization problem that aims to maximize tourists' satisfaction by selecting points of interest (POIs) to visit and determining the most efficient routes within a limited time frame. In this process, POIs must be organized into specific clusters, and visit sequences as well as routes within each cluster need to be determined. In this context, the Clustered Team Orienteering Problem (CTOP) provides a strong framework for optimizing the routes of multiple tours. CTOP aims to determine the routes that yield the highest total reward by selecting POIs with varying visit values while adhering to time constraints. The primary distinction of CTOP from the well-known Team Orienteering Problem in the literature is the requirement that POIs be structured into clusters and that routes must be designed accordingly. In CTOP, visiting all clusters is not mandatory; however, if a cluster is selected, all POIs within that cluster must be visited. This study introduces a novel mathematical model for CTOP and conducts comparative analyses against existing models. The proposed model is tested on widely used benchmark datasets and evaluated in terms of solution quality and computational efficiency. The results demonstrate that the proposed model provides faster, more effective, and more practical solutions compared to existing models.
Keywords
- Vehicle Routing
- Transportation
- Mathematical Programming
Status: accepted
Back to the list of papers