Arc Routing Problems, Part II: The Rural Postman Problem

This is the second half of a two-part survey on Arc Routing Problems. Here, the Rural Postman Problem (RPP) is reviewed. The paper is organized as follows: Applications, the Undirected RPP, the Directed RPP, the Stacker Crane problem, the Capacitated Arc Routing Problem. (A)

[1]  Martin Grötschel,et al.  Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..

[2]  A Lukka.  COMPARISON OF THREE HEURISTICS FOR AN ARC ROUTING PROBLEM , 1987 .

[3]  José Manuel Belenguer Ribera.  El poliedro del problema de rutas por arcos con capacidades , 1990 .

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

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

[6]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

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

[8]  Lawrence Bodin,et al.  The Arc Oriented Location Routing Problem , 1989 .

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

[10]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[11]  Jeff R. Wright,et al.  APPLICATION OF ROUTING TECHNOLOGIES TO RURAL SNOW AND ICE CONTROL , 1991 .

[12]  Lawrence Bodin,et al.  The design of a computerized sanitation vehicle routing and scheduling system for the town of oyster bay, new york , 1989, Comput. Oper. Res..

[13]  Wen Lea Pearn,et al.  Augment-insert algorithms for the capacitated arc routing problem , 1991, Comput. Oper. Res..

[14]  Alexander H. G. Rinnooy Kan,et al.  Bounds and Heuristics for Capacitated Routing Problems , 1985, Math. Oper. Res..

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

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

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

[18]  José María Sanchís Llopis.  El poliedro del problema del cartero rural , 1990 .

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

[20]  John E. Beasley,et al.  Route first--Cluster second methods for vehicle routing , 1983 .

[21]  Gilbert Laporte,et al.  Locating Postal Relay Boxes Using a set Covering Algorithm , 1989 .

[22]  Richard W. Eglese,et al.  Efficient Routeing for Winter Gritting , 1992 .

[23]  James W. Male,et al.  Districting and Routing for Solid Waste Collection , 1978 .

[24]  G. Ulusoy.  The fleet size and mix problem for capacitated arc routing , 1985 .

[25]  Bernhard Fleischmann,et al.  A new class of cutting planes for the symmetric travelling salesman problem , 1988, Math. Program..

[26]  Robert Stricker,et al.  Public sector vehicle routing : the Chinese postman problem. , 1970 .

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

[28]  G. Lapalme,et al.  A parallel insert method for the capacitated arc routing problem , 1984 .

[29]  Wayne Turner,et al.  The Optimal Routing of Solid Waste Collection Vehicles , 1975 .

[30]  Lawrence Bodin,et al.  Routing and Scheduling of School Buses by Computer , 1979 .

[31]  Arthur J. Swersey,et al.  Scheduling School Buses , 1984 .

[32]  Gilbert Laporte,et al.  Location routing problems , 1987 .

[33]  Dirk Cattrysse,et al.  Public Waste Collection: A Case Study. , 1991 .

[34]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[35]  Moshe Dror,et al.  Routing electric meter readers , 1979, Comput. Oper. Res..

[36]  Richard D. McBride,et al.  Controlling left and u-turns in the routing of refuse collection vehicles , 1982, Comput. Oper. Res..

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

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

[39]  R. Eglese,et al.  Routeing Road Sweepers in a Rural Area , 1991 .

[40]  Gilbert Laporte,et al.  Capacitated Vehicle Routing on Trees , 1991, Oper. Res..

[41]  Pierre F. Lemieux,et al.  The snow ploughing problem solved by a graph theory algorithm , 1984 .

[42]  Gérard Cornuéjols,et al.  The traveling salesman problem on a graph and some related integer polyhedra , 1985, Math. Program..

[43]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[44]  Robert M. Clark,et al.  Systems planning for solid waste collection , 1976, Comput. Oper. Res..

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

[46]  Lawrence Bodin,et al.  The arc partitioning problem , 1991 .

[47]  Lawrence Bodin,et al.  Networks and vehicle routing for municipal waste collection , 1974, Networks.

[48]  Matteo Fischetti,et al.  An additive bounding procedure for the asymmetric travelling salesman problem , 1992, Math. Program..

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

[50]  T. M. Cook,et al.  SNOW AND ICE REMOVAL IN AN URBAN ENVIRONMENT , 1976 .

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

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

[53]  Elena Minazzato.  La raccolta dei rifiuti solidi urbani nella città di Como. Modelli e algoritmi di ricerca operativa , 1987 .

[54]  Jean-Marc Rousseau,et al.  Clustering for routing in densely populated areas , 1985 .

[55]  Lawrence Bodin,et al.  A detailed description of a computer system for the routing and scheduling of street sweepers , 1979, Comput. Oper. Res..

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

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

[58]  Ángel Corberán,et al.  The capacitated arc routing problem. A heuristic algorithm , 1990 .

[59]  Lawrence Bodin,et al.  A Computer-Assisted System for the Routing and Scheduling of Street Sweepers , 1978, Oper. Res..

[60]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

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

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

[63]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.