The cooperative orienteering problem with time windows

In this we paper we define a new class of the team orienteering problem; the cooperative orienteering problem with time windows (COPTW). The COPTW is a generalisation of the TOPTW, which requires multiple vehicles to cooperatively collect the reward from a location. The COPTW is demonstrated with the aid of a wildfire scenario in South Hobart, Tasmania Australia. Computational testing suggests that it is feasible to apply the COPTW to realistic problems.

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

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

[3]  Steven E. Butt,et al.  An optimal solution procedure for the multiple tour maximum collection problem using column generation , 1999, Comput. Oper. Res..

[4]  John Handmer,et al.  A review of operations research methods applicable to wildfire management , 2012 .

[5]  A. Weintraub,et al.  Forest management challenges for operational researchers , 1998 .

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

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

[8]  Andrew Lim,et al.  An iterative three-component heuristic for the team orienteering problem with time windows , 2014, Eur. J. Oper. Res..

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

[10]  David L. Martell,et al.  A review of operational research studies in forest fire management , 1982 .

[11]  A. Sullivan,et al.  Wildland surface fire spread modelling, 1990–2007. 2: Empirical and quasi-empirical models , 2007, 0706.4128.

[12]  Daniele Vigo,et al.  Vehicle Routing Problems with Profits , 2014, Vehicle Routing.

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

[14]  Cyrille Gueguen.  Méthodes de résolution exacte pour les problèmes de tournées de véhicules , 1999 .

[15]  M. G. Kantor,et al.  The Orienteering Problem with Time Windows , 1992 .