Solving the tourist trip design problem with time windows and variable profit using incremental local search
[EN] The Team Orienteering Problem with Time Windows and Variable Profits (TOPTWVP) is a variant of the Orienteering Problem where each node has a predefined time window in which the service must start (in case this node is visited), and the vehicle may spend an amount of time given by a predefined...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2024 |
| País: | España |
| Institución: | Universitat Politècnica de València (UPV) |
| Repositorio: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglés |
| OAI Identifier: | oai:riunet.upv.es:10251/207611 |
| Acceso en línea: | https://riunet.upv.es/handle/10251/207611 |
| Access Level: | acceso abierto |
| Palabra clave: | Tourist trip design problems Algorithmic modelling and optimization LENGUAJES Y SISTEMAS INFORMATICOS |
| Sumario: | [EN] The Team Orienteering Problem with Time Windows and Variable Profits (TOPTWVP) is a variant of the Orienteering Problem where each node has a predefined time window in which the service must start (in case this node is visited), and the vehicle may spend an amount of time given by a predefined interval so that the profit collected at this node depends on the time spent. Our previous work introduced an incremental local search procedure to solve this problem. Although the results were satisfying in terms of score, this algorithm required more time to obtain solutions due to the added complexity of working with service time intervals. To address this issue, this paper introduces several improvements to our previous implementation aimed at reducing the execution time and maintaining or increasing the quality of the solutions. Specifically, we designed a new procedure for obtaining the initial solution, which is faster and generates higher -quality solutions than the previous approach. Moreover, two new moves have been developed within the local search procedure to account for variable profits. The experiments will show that these new procedures outperform our previous implementations. Finally, we define different types of trips depending on the travel -style preferences of a tourist, and we build some scenarios to show how our TOPTWVP can be adapted to obtain routes that fulfil these preferences. |
|---|