The capacitated team orienteering and profitable tour problems

In this paper, we study the capacitated team orienteering and profitable tour problems (CTOP and CPTP). The interest in these problems comes from recent developments in the use of the Internet for a better matching of demand and offer of transportation services. We propose exact and heuristic procedures for the CTOP and the CPTP. The computational results show that the heuristic procedures often find the optimal solution and in general cause very limited errors.

[1]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[2]  F. Maffioli,et al.  On prize-collecting tours and the asymmetric travelling salesman problem , 1995 .

[3]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[4]  Alain Hertz,et al.  Metaheuristics for the team orienteering problem , 2005, J. Heuristics.

[5]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[6]  Nicos Christofides,et al.  The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.

[7]  Tom M. Cavalier,et al.  A heuristic for the multiple tour maximum collection problem , 1994, Comput. Oper. Res..

[8]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[9]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[10]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[11]  Michel Gendreau,et al.  An exact algorithm for team orienteering problems , 2007, 4OR.

[12]  Elise Miller-Hooks,et al.  A TABU search heuristic for the team orienteering problem , 2005, Comput. Oper. Res..

[13]  Michel Gendreau,et al.  New Refinements for the Solution of Vehicle Routing Problems with Branch and Price , 2007, INFOR Inf. Syst. Oper. Res..