Analysis of the selective traveling salesman problem with time-dependent profits
Open Access
- 22 April 2022
- journal article
- research article
- Published by Springer Nature in TOP
- Vol. 31 (1) , 165-193
Abstract
We consider a generalization of the selective traveling salesman problem (STSP) in which the benefit of visiting a location changes over time. This new problem, called the selective travelling salesman problem with time-dependent profits (STSP-TDP), is defined on a graph with time-dependent profits associated with the vertices, and consists of determining a circuit of maximal total profit. In the STSP-TDP the tour length must not exceed a maximum value, and its starting and ending times must both lie within a prespecified planning horizon. This problem arises in planning tourist itineraries, mailbox collection, military surveillance, and water sampling, where the traveler accumulates different profits upon visiting the locations throughout the day. We focus on analyzing several variants of the problem depending on the shape of the time-dependent profit function. If this function is not monotonic, it may be worth visiting a site more than once. We propose formulations for the single-visit case and for when multiple visits are allowed, in which case the problem reduces to an STSP, which is adapted to be solved as a longest path problem. These formulations are then solved for piecewise-linear profit functions using a general-purpose solver, and tested on several artificially created instances and on four TSPLib instances involving up to 535 vertices. A detailed analysis of the problem and the solution is performed.Keywords
This publication has 23 references indexed in Scilit:
- A survey on algorithmic approaches for solving tourist trip design problemsJournal of Heuristics, 2014
- The orienteering problem with variable profitsNetworks, 2013
- The orienteering problem: A surveyEuropean Journal of Operational Research, 2011
- Metaheuristics for the bi-objective orienteering problemSwarm Intelligence, 2009
- Lasso solution strategies for the vehicle routing problem with pickups and deliveriesEuropean Journal of Operational Research, 2009
- A PERSONALIZED TOURIST TRIP DESIGN ALGORITHM FOR MOBILE TOURIST GUIDESApplied Artificial Intelligence, 2008
- Using a Genetic Algorithm to Solve the Generalized Orienteering Problem2008
- General solutions to the single vehicle routing problem with pickups and deliveriesEuropean Journal of Operational Research, 2007
- Traveling Salesman Problems with ProfitsTransportation Science, 2005
- The selective travelling salesman problemDiscrete Applied Mathematics, 1990