Improved lower bounds and exact algorithm for the capacitated arc routing problem

In the capacitated arc routing problem (CARP), a subset of the edges of an undirected graph has to be serviced at least cost by a fleet of identical vehicles in such a way that the total demand of the edges serviced by each vehicle does not exceed its capacity. This paper describes a new lower bounding method for the CARP based on a set partitioning-like formulation of the problem with additional cuts. This method uses cut-and-column generation to solve different relaxations of the problem, and a new dynamic programming method for generating routes. An exact algorithm based on the new lower bounds was also implemented to assess their effectiveness. Computational results over a large set of classical benchmark instances show that the proposed method improves most of the best known lower bounds for the open instances, and can solve several of these for the first time.

[1]  Richard W. Eglese,et al.  Routeing Winter Gritting Vehicles , 1994, Discret. Appl. Math..

[2]  Michel Gendreau,et al.  Arc Routing Problems, Part II: The Rural Postman Problem , 1995, Oper. Res..

[3]  Ángel Corberán,et al.  Recent results on Arc Routing Problems: An annotated bibliography , 2010 .

[4]  José-Manuel Belenguer,et al.  A cutting plane algorithm for the capacitated arc routing problem , 2003, Comput. Oper. Res..

[5]  Sanne Wøhlk.  A Decade of Capacitated Arc Routing , 2008 .

[6]  M. BelenguerJ.,et al.  The Capacitated Arc Routing Problem , 1998 .

[7]  B. Golden,et al.  The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases , 1987 .

[8]  Roberto Baldacci,et al.  Exact methods based on node-routing formulations for undirected arc-routing problems , 2006 .

[9]  Roberto Roberti,et al.  New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem , 2011, Oper. Res..

[10]  Stefan Voß,et al.  A hierarchical relaxations lower bound for the capacitated arc routing problem , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[11]  Stefan Irnich,et al.  Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem , 2012, Oper. Res..

[12]  Nicos Christofides.  The optimum traversal of a graph , 1973 .

[13]  Ángel Corberán,et al.  Recent results on Arc Routing Problems: An annotated bibliography , 2010, Networks.

[14]  Wen Lea Pearn,et al.  New lower bounds for the Capacitated Arc Routing Problem , 1988, Networks.

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

[16]  David Pisinger,et al.  Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows , 2008, Oper. Res..

[17]  M. R. Rao,et al.  Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..

[18]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..

[19]  Gilbert Laporte,et al.  Exact solution of the generalized routing problem through graph transformations , 2003, J. Oper. Res. Soc..

[20]  Bruce L. Golden,et al.  Chapter 5 Arc routing methods and applications , 1995 .

[21]  Zaw Win,et al.  Contributions to routing problems , 1987 .

[22]  Adam N. Letchford,et al.  A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..

[23]  Sanne Wøhlk.  New lower bound for the Capacitated Arc Routing Problem , 2006, Comput. Oper. Res..

[24]  Bruce L. Golden,et al.  Computational experiments with algorithms for a class of routing problems , 1983, Comput. Oper. Res..

[25]  Richard W. Eglese,et al.  An Interactive Algorithm for Vehicle Routeing for Winter — Gritting , 1996 .

[26]  José-Manuel Belenguer,et al.  The Capacitated Arc Routing Problem: Valid Inequalities and Facets , 1998, Comput. Optim. Appl..

[27]  Bruce L. Golden,et al.  Capacitated arc routing problems , 1981, Networks.

[28]  Bruce L. Golden,et al.  The vehicle routing problem : latest advances and new challenges , 2008 .

[29]  Gianpaolo Ghiani,et al.  An efficient transformation of the generalized vehicle routing problem , 2000, Eur. J. Oper. Res..

[30]  Gilbert Laporte,et al.  Arc Routing Problems, Part I: The Chinese Postman Problem , 1995, Oper. Res..

[31]  Ángel Corberán,et al.  The Capacitated Arc Routing Problem: Lower bounds , 1992, Networks.

[32]  J. F. Rudge,et al.  Series Solutions to Static Team Control Problems , 1976, Math. Oper. Res..

[33]  John R. Current,et al.  An improved ant colony optimization based algorithm for the capacitated arc routing problem , 2010 .

[34]  Roberto Roberti,et al.  New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows , 2012, INFORMS J. Comput..

[35]  Adam N. Letchford,et al.  Exploiting sparsity in pricing routines for the capacitated arc routing problem , 2009, Comput. Oper. Res..

[36]  Roberto Baldacci,et al.  Exact methods based on node‐routing formulations for undirected arc‐routing problems , 2006, Networks.

[37]  Luc Muyldermans,et al.  A guided local search heuristic for the capacitated arc routing problem , 2003, Eur. J. Oper. Res..

[38]  Ryuichi Hirabayashi,et al.  NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM , 1992 .

[39]  Renato F. Werneck,et al.  Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2004, Math. Program..

[40]  Marcus Poggi de Aragão,et al.  Solving capacitated arc routing problems using a transformation to the CVRP , 2006, Comput. Oper. Res..

[41]  Nicos Christofides,et al.  An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts , 2008, Math. Program..