Recent Trends in Arc Routing

Arc routing problems (ARPs) arise naturally in several applications where streets require maintenance, or customers located along road must be serviced. The undirected rural postman problem (URPP) is to determine a least cost tour traversing at least once each edge that requires a service. When demands are put on the edges and this total demand must be covered by a fleet of identical vehicles of capacity Q based at a depot, one gets the undirected capacitated arc routing problem (UCARP). The URPP and UCARP are known to be NP-hard. This chapter reports on recent exact and heuristic algorithms for the URPP and UCARP.

[1]  Wen Lea Pearn,et al.  Algorithms for the rural postman problem , 1995, Comput. Oper. Res..

[2]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[3]  Paolo Toth,et al.  Lower bounds and reduction procedures for the bin packing problem , 1990, Discret. Appl. Math..

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

[5]  Jan Karel Lenstra,et al.  On general routing problems , 1976, Networks.

[6]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

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

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

[9]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[10]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[12]  Á. Corberán,et al.  A polyhedral approach to the rural postman problem , 1994 .

[13]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..

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

[15]  Michel Mittaz.  Problèmes de cheminements optimaux dans les réseaux avec contraintes associées aux arcs , 2000 .

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

[17]  Francisco Barahona,et al.  On the cycle polytope of a binary matroid , 1986, J. Comb. Theory, Ser. B.

[18]  Martin Grötschel,et al.  A cutting plane algorithm for the windy postman problem , 1992, Math. Program..

[19]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[20]  G. Nemhauser,et al.  Integer Programming , 2020 .

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

[22]  Greg N. Frederickson,et al.  Approximation Algorithms for Some Postman Problems , 1979, JACM.

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

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

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

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

[27]  Alain Hertz,et al.  A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem , 2001, Transp. Sci..

[28]  Ángel Corberán,et al.  An algorithm for the Rural Postman problem on a directed graph , 1986 .

[29]  Richard W. Eglese,et al.  A tabu search based heuristic for arc routing with a capacity constraint and time deadline , 1996 .

[30]  Moshe Dror,et al.  Postman tour on a graph with precedence relation on arcs , 1987, Networks.

[31]  Jean-Marc Rousseau,et al.  The Capacitated Canadian Postman Problem , 1989 .

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

[33]  Jack Edmonds,et al.  Matching, Euler tours and the Chinese postman , 1973, Math. Program..

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

[35]  J. P. Kelly,et al.  Meta-heuristics : theory & applications , 1996 .

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

[37]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[38]  Gilbert Laporte,et al.  A branch-and-cut algorithm for the Undirected Rural Postman Problem , 2000, Math. Program..

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

[40]  Wen Lea Pearn,et al.  Approximate solutions for the capacitated arc routing problem , 1989, Comput. Oper. Res..

[41]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[42]  Adam N. Letchford.  Polyhedral Results for Some Constrained Arc-Routing Problems , 1996 .

[43]  C. S. Orloff.  A fundamental problem in vehicle routing , 1974, Networks.