Exact methods based on node-routing formulations for undirected arc-routing problems

This article proposes a new transformation of undirected arc-routing problems into equivalent node-routing problems, with emphasis on the transformation of Capacitated Arc Routing Problems (CARP) into Capacitated Vehicle Routing Problems (CVRP). For this last case, an analogue transformation has already been proposed in Pearn et al., where each required CARP edge is mapped onto a triplet of CVRP nodes. In our case, only two CVRP nodes are needed for every CARP required edge. The transformed instances have a structure and a dimension that make most CARP benchmarks solvable by state of the art CVRP techniques. We thus propose a general purpose transformation of arc into node-routing problems and new results on lower bounds and exact methods for CARP instances. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 47(1), 52–60 2006

[1]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[2]  Gilbert Laporte,et al.  Optimal Routing under Capacity and Distance Restrictions , 1985, Oper. Res..

[3]  Wen Lea Pearn,et al.  Transforming arc routing into node routing problems , 1987, Comput. Oper. Res..

[4]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

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

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

[7]  Shanling Li,et al.  Multi-job Cutting Stock Problem with Due Dates and Release Dates , 1996 .

[8]  Ángel Corberán,et al.  Separating capacity constraints in the CVRP using tabu search , 1998, Eur. J. Oper. Res..

[9]  Giovanni Rinaldi,et al.  Computational results with a branch and cut code for the capacitated vehicle routing problem , 1998 .

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

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

[12]  Leslie E. Trotter,et al.  On the capacitated vehicle routing problem , 2003, Math. Program..

[13]  Roberto Baldacci,et al.  Exact methods based on node routing formulations for arc routing problems , 2004 .

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

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

[16]  Roberto Baldacci,et al.  An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation , 2004, Oper. Res..

[17]  Vittorio Maniezzo.  Algorithms for large directed CARP instances: urban solid waste collection operational support , 2004 .

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

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

[20]  Mauro Dell'Amico,et al.  The Capacitated m-Ring-Star Problem , 2007, Oper. Res..