An iterated local search algorithm for the team orienteering problem with variable profits

ABSTRACT The orienteering problem (OP) is a routing problem that has numerous applications in various domains such as logistics and tourism. The objective is to determine a subset of vertices to visit for a vehicle so that the total collected score is maximized and a given time budget is not exceeded. The extensive application of the OP has led to many different variants, including the team orienteering problem (TOP) and the team orienteering problem with time windows. The TOP extends the OP by considering multiple vehicles. In this article, the team orienteering problem with variable profits (TOPVP) is studied. The main characteristic of the TOPVP is that the amount of score collected from a visited vertex depends on the duration of stay on that vertex. A mathematical programming model for the TOPVP is first presented and an algorithm based on iterated local search (ILS) that is able to solve modified benchmark instances is then proposed. It is concluded that ILS produces solutions which are comparable to those obtained by the commercial solver CPLEX for smaller instances. For the larger instances, ILS obtains good-quality solutions that have significantly better objective value than those found by CPLEX under reasonable computational times.

[1]  Duc-Cuong Dang,et al.  Solving the team orienteering problem with cutting planes , 2016, Comput. Oper. Res..

[2]  Dirk Van Oudheusden,et al.  A PERSONALIZED TOURIST TRIP DESIGN ALGORITHM FOR MOBILE TOURIST GUIDES , 2008, Appl. Artif. Intell..

[3]  Gilbert Laporte,et al.  The orienteering problem with variable profits , 2013, Networks.

[4]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

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

[6]  Felix T.S. Chan,et al.  Pareto mimic algorithm: An approach to the team orienteering problem , 2016 .

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

[8]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .

[9]  G. Dueck.  New optimization heuristics , 1993 .

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

[11]  Hoong Chuin Lau,et al.  Orienteering Problem: A survey of recent variants, solution approaches and applications , 2016, Eur. J. Oper. Res..

[12]  Gilbert Laporte,et al.  The selective travelling salesman problem , 1990, Discret. Appl. Math..

[13]  Dirk Cattrysse,et al.  A variable neighborhood search method for the orienteering problem with hotel selection , 2013 .

[14]  Dirk Van Oudheusden,et al.  A guided local search metaheuristic for the team orienteering problem , 2009, Eur. J. Oper. Res..

[15]  R. Vohra,et al.  The Orienteering Problem , 1987 .

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

[17]  Luís M. S. Dias,et al.  Solving the Team Orienteering Problem: Developing a Solution Tool Using a Genetic Algorithm Approach , 2014 .

[18]  André Langevin,et al.  A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints , 2017, Comput. Oper. Res..

[19]  Daniele Vigo,et al.  Enhanced exact solution methods for the Team Orienteering Problem , 2016 .

[20]  张思学.  电脑硬件知识一：CPU（Central Processing Unit） , 2005 .

[21]  Mac Schwager,et al.  Correlated Orienteering Problem and its application to informative path planning for persistent monitoring tasks , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[22]  Bruce L. Golden,et al.  A fast and effective heuristic for the orienteering problem , 1996 .

[23]  Michel Gendreau,et al.  The Covering Tour Problem , 1997, Oper. Res..

[24]  Duc-Cuong Dang,et al.  An effective PSO-inspired algorithm for the team orienteering problem , 2013, Eur. J. Oper. Res..

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