A matheuristic for the Team Orienteering Arc Routing Problem

In the Team Orienteering Arc Routing Problem (TOARP) the potential customers are located on the arcs of a directed graph and are to be chosen on the basis of an associated profit. A limited fleet of vehicles is available to serve the chosen customers. Each vehicle has to satisfy a maximum route duration constraint. The goal is to maximize the profit of the served customers. We propose a matheuristic for the TOARP and test it on a set of benchmark instances for which the optimal solution or an upper bound is known. The matheuristic finds the optimal solutions on all, except one, instances of one of the four classes of tested instances (with up to 27 vertices and 296 arcs). The average error on all instances for which the optimal solution is available is 0.67 percent.

[1]  Jalel Euchi,et al.  Hybrid metaheuristics for the profitable arc tour problem , 2011, J. Oper. Res. Soc..

[2]  Demetrio Laganà,et al.  A Branch-and-Cut Algorithm for the Undirected Capacitated Arc Routing Problem , 2007 .

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

[4]  Luca Bertazzi,et al.  A Hybrid Heuristic for an Inventory Routing Problem , 2012, INFORMS J. Comput..

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

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

[7]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[8]  Elena Fernández,et al.  Solving the Prize-collecting Rural Postman Problem , 2009, Eur. J. Oper. Res..

[9]  Ángel Corberán,et al.  The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra , 2008, SIAM J. Discret. Math..

[10]  M. Dror.  Arc Routing : Theory, Solutions and Applications , 2000 .

[11]  Ángel Corberán,et al.  New facets and an enhanced branch‐and‐cut for the min–max K‐vehicles windy rural postman problem , 2011, Networks.

[12]  W. L. Pearn,et al.  Approximate solutions for the maximum benefit chinese postman problem , 2005, Int. J. Syst. Sci..

[13]  Michel Gendreau,et al.  The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm , 2005, Transp. Sci..

[14]  Ángel Corberán,et al.  The mixed general routing polyhedron , 2003, Math. Program..

[15]  Adam N. Letchford.  New inequalities for the General Routing Problem , 1997 .

[16]  Martin W. P. Savelsbergh,et al.  An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem , 2008, Transp. Sci..

[17]  K. H. Wang,et al.  On the maximum benefit Chinese Postman Problem , 2003 .

[18]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Capacitated Arc Routing Problem , 2000, Oper. Res..

[19]  Ángel Corberán,et al.  The Team Orienteering Arc Routing Problem , 2014, Transp. Sci..

[20]  Elena Fernández,et al.  The Clustered Prize-Collecting Arc Routing Problem , 2009, Transp. Sci..

[21]  M. Ball.  Heuristics based on mathematical programming , 2011 .

[22]  Ángel Corberán,et al.  Min-Max K-vehicles windy rural postman problem , 2009 .

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

[24]  Cristina Zoltan,et al.  Privatized rural postman problems , 2006, Comput. Oper. Res..

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

[26]  Ángel Corberán,et al.  Min‐Max K‐vehicles windy rural postman problem , 2009, Networks.

[27]  Maria Grazia Speranza,et al.  A survey on matheuristics for routing problems , 2014, EURO J. Comput. Optim..

[28]  Emmanouil E. Zachariadis,et al.  Local search for the undirected capacitated arc routing problem with profits , 2011, Eur. J. Oper. Res..

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

[30]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[31]  Ángel Corberán,et al.  A branch-and-cut algorithm for the maximum benefit Chinese postman problem , 2013, Math. Program..

[32]  Ángel Corberán,et al.  The Windy Clustered Prize-Collecting Arc-Routing Problem , 2011, Transp. Sci..

[33]  M. Daskin,et al.  The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem , 1993 .

[34]  Vittorio Maniezzo,et al.  Matheuristics: Hybridizing Metaheuristics and Mathematical Programming , 2009 .

[35]  Maria Grazia Speranza,et al.  An ILP-refined tabu search for the Directed Profitable Rural Postman Problem , 2014, Discret. Appl. Math..

[36]  Gilbert Laporte,et al.  Improvement Procedures for the Undirected Rural Postman Problem , 1999, INFORMS J. Comput..

[37]  Alain Hertz,et al.  The undirected capacitated arc routing problem with profits , 2010, Comput. Oper. Res..