A review of recent advances in time-dependent vehicle routing
In late 2015 three of the co-authors of this paper published the first review on time-
dependent routing problems. Since then, there have been several important algorithmic …
dependent routing problems. Since then, there have been several important algorithmic …
The vacation planning problem: A multi-level clustering-based metaheuristic approach
Abstract We study the Vacation Planning Problem (VPP), an extension of the Tourist Trip
Design Problem which is suitable for modelling scenarios wherein a tourist wishes to …
Design Problem which is suitable for modelling scenarios wherein a tourist wishes to …
An integrated recommender system for multi-day tourist itinerary
Planning a personalized itinerary that satisfies the preferences and limitations of a tourist
can be a complex task. The challenge is further compounded by the lack of information …
can be a complex task. The challenge is further compounded by the lack of information …
Optimization for the multiday urban personalized trip design problem with time windows and transportation mode recommendations
J Zhong, X Wang, L Li - Transportation Research Record, 2023 - journals.sagepub.com
The urban tourism market has been increasingly dominated by the demand for personalized
experiences. This paper focuses on the multiday urban personalized trip design problem …
experiences. This paper focuses on the multiday urban personalized trip design problem …
Multipath traveling purchaser problem with time-dependent market structure using quantum-inspired variable length genetic algorithm
In develo** countries, rural and semi-urban markets remain open for a particular period of
time in a day, and items' availabilities and prices vary within the opening hours of a market …
time in a day, and items' availabilities and prices vary within the opening hours of a market …
[HTML][HTML] A learning-based granular variable neighborhood search for a multi-period election logistics problem with time-dependent profits
M Shahmanzari, R Mansini - European Journal of Operational Research, 2024 - Elsevier
Planning the election campaign for leaders of a political party is a complex problem. The
party representatives, running mates, and campaign managers have to design an efficient …
party representatives, running mates, and campaign managers have to design an efficient …
Team orienteering with possible multiple visits: Mathematical model and solution algorithms
This study addresses a new team orienteering problem in which each point can be visited
possibly multiple times with decreasing scores. The problem is to determine a set of routes …
possibly multiple times with decreasing scores. The problem is to determine a set of routes …
The regular language-constrained orienteering problem with time windows
Several application domains of the Orienteering Problem (OP) entail the categorization of
graph nodes. Specific categories of nodes may be preferred to be included in the solution …
graph nodes. Specific categories of nodes may be preferred to be included in the solution …
[HTML][HTML] Solving the tourist trip design problem with time windows and variable profit using incremental local search
Abstract 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 …
(TOPTWVP) is a variant of the Orienteering Problem where each node has a predefined time …
Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
Abstract The Time Dependent (TD) Traveling Salesman Problem (TSP) is a generalization of
the TSP which allows one to take traffic conditions into account when planning tours in an …
the TSP which allows one to take traffic conditions into account when planning tours in an …