The capacitated team orienteering problem with incomplete service

In this paper we study the capacitated version of the Team Orienteering Problem (TOP), that is the Capacitated TOP (CTOP) and the impact of relaxing the assumption that a customer, if served, must be completely served. We prove that the profit collected by the CTOP with Incomplete Service (CTOP-IS) may be as large as twice the profit collected by the CTOP. A computational study is also performed to evaluate the average increase of the profit due to allowing incomplete service. The results show that the increase of the profit strongly depends on the specific instance. On the tested instances the profit increase ranges between 0 and 50 %. We complete the computational study with the increase of the profit of the CTOP due to split deliveries, that is multiple visits to the same customer, and to split deliveries combined with incomplete service.

[1]  Alain Hertz,et al.  The capacitated team orienteering and profitable tour problems , 2007, J. Oper. Res. Soc..

[2]  Zuren Feng,et al.  Ants can solve the team orienteering problem , 2008, Comput. Ind. Eng..

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

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

[5]  Alain Hertz,et al.  The split delivery capacitated team orienteering problem , 2010, Networks.

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

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

[8]  Roberto Montemanni,et al.  An ant colony system for team orienteering problems with time windows , 2023, 2305.07305.

[9]  Dirk Van Oudheusden,et al.  A Path Relinking approach for the Team Orienteering Problem , 2010, Comput. Oper. Res..

[10]  Alain Hertz,et al.  Incomplete service and split deliveries in a routing problem with profits , 2014, Networks.

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

[12]  Richard F. Hartl,et al.  Heuristics for the multi-period orienteering problem with multiple time windows , 2010, Comput. Oper. Res..

[13]  Dirk Van Oudheusden,et al.  Iterated local search for the team orienteering problem with time windows , 2009, Comput. Oper. Res..

[14]  William J. Cook,et al.  Combinatorial optimization , 1997 .

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

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

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

[18]  Dirk Van Oudheusden,et al.  The orienteering problem: A survey , 2011, Eur. J. Oper. Res..

[19]  Henrique Viana,et al.  The Team Orienteering Problem: Formulations and Branch-Cut and Price , 2010, ATMOS.

[20]  Dirk Van Oudheusden,et al.  The Multiconstraint Team Orienteering Problem with Multiple Time Windows , 2010, Transp. Sci..

[21]  Maria Grazia Speranza,et al.  Optimal solutions for routing problems with profits , 2013, Discret. Appl. Math..