Skip to main content
SpringerLink
Log in

Recent Trends in Arc Routing

  • Chapter
Graph Theory, Combinatorics and Algorithms

Part of the book series: Operations Research/Computer Science Interfaces Series ((volume 34))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.A. Assad and B.L. Golden, Arc Routing Methods and Applications, in M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser (eds.), Network Routing, Handbooks in Operations Research and Management Science, North-Holland, Amsterdam, (1995).

    Google Scholar 

  2. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, (1973).

    MATH  Google Scholar 

  3. F. Barahona and M. Grötschel, On the Cycle Polytope of a Binary Matroid, Journal of Combinatorial Theory 40: 40–62 (1986).

    MATH  Google Scholar 

  4. J.M. Belenguer and E. Benavent, A Cutting Plane Algorithm for the Capacitated Arc Routing Problem, Unpublished manuscript, University of Valencia, Spain, (1997).

    Google Scholar 

  5. E. Benavent, ftp://indurain.estadi.uv.ed/pub/CARP, (1997).

    Google Scholar 

  6. E. Benavent, V. Campos, A. Corberán and E. Mota, The Capacitated Arc Routing Problem: Lower Bounds, Networks 22: 669–690 (1992).

    MathSciNet  MATH  Google Scholar 

  7. N. Christofides, The Optimum Traversal of a Graph, Omega 1: 719–732 (1973).

    Article  Google Scholar 

  8. N. Christofides, Worst Case Analysis of a New Heuristic for the Traveling Salesman Problem, Report No 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, (1976).

    Google Scholar 

  9. N. Christofides, V. Campos, A. Corberán and E. Mota, An Algorithm for the Rural Postman Problem, Imperial College Report I C.O.R. 81.5, London, (1981).

    Google Scholar 

  10. A. Corberán and J.M. Sanchis, A Polyhedral Approach to the Rural Postman Problem, European Journal of Operational Research 79: 95–114 (1994).

    MATH  Google Scholar 

  11. G.A. Croes, A Method for Solving Traveling-Salesman Problems, Operations Research 6: 791–812 (1958).

    MathSciNet  Google Scholar 

  12. G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, Solution of a Large Scale Traveling Salesman Problem, Operations Research 2: 393–410 (1954).

    MathSciNet  Google Scholar 

  13. J.S. DeArmon, A Comparison of Heuristics for the Capacitated Chinese Postman Problem, Master’s Thesis, University of Maryland at College Park, (1981).

    Google Scholar 

  14. M. Dror, ARC Routing: Theory, Solutions and Applications, Kluwer Academic Publishers, Boston, (2000).

    MATH  Google Scholar 

  15. M. Dror, H. Stern and P. Trudeau Postman Tour on a Graph with Precedence Relation on Arcs, Networks 17: 283–294 (1987).

    MathSciNet  MATH  Google Scholar 

  16. J. Edmonds and E.L. Johnson, Matching, Euler Tours and the Chinese Postman Problem, Mathematical Programming 5: 88–124 (1973).

    Article  MathSciNet  MATH  Google Scholar 

  17. R.W. Eglese, Routing Winter Gritting Vehicles, Discrete Applied Mathematics 48: 231–244 (1994).

    Article  MATH  Google Scholar 

  18. R.W. Eglese and L.Y.O. Li, A Tabu Search Based Heuristic for Arc Routing with a Capacity Constraint and Time Deadline, in I.H. Osman and J.P. Kelly (eds.), Meta-Heuristics: Theory & Applications, Kluwer Academic Publishers, Boston, (1996).

    Google Scholar 

  19. H.A. Eiselt, M. Gendreau and G. Laporte, Arc Routing Problems, Part 1: The Chinese Postman Problem, Operations Research 43: 231–242 (1995a).

    MathSciNet  MATH  Google Scholar 

  20. H.A. Eiselt, M. Gendreau and G. Laporte, Arc Routing Problems, Part 2: The Rural Postman Problem, Operations Research 43: 399–414 (1995b).

    MathSciNet  MATH  Google Scholar 

  21. M. Fischetti, J.J. Salazar and P. Toth, A Branch-and Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem, Operations Research 45: 378–394 (1997).

    MathSciNet  MATH  Google Scholar 

  22. G.N. Frederickson, Approximation Algorithms for Some Postman Problems, Journal of the A.C.M. 26: 538–554 (1979).

    MATH  MathSciNet  Google Scholar 

  23. M. Gendreau, A. Hertz and G. Laporte, A Tabu Search Heuristic for the Vehicle Routing Problem, Management Science 40: 1276–1290 (1994).

    MATH  Google Scholar 

  24. G. Ghiani and G. Laporte, A Branch-and-cut Algorithm for the Undirected Rural Postman Problem, Mathematical Programming 87: 467–481 (2000).

    Article  MathSciNet  MATH  Google Scholar 

  25. F. Glover, Tabu Search — Part I, ORSA Journal on Computing 1: 190–206 (1989).

    MATH  MathSciNet  Google Scholar 

  26. B.L. Golden, J.S. DeArmon and E.K. Baker, Computational Experiments with Algorithms for a Class of Routing Problems, Computers & Operations Research 10: 47–59 (1983).

    Article  MathSciNet  Google Scholar 

  27. B.L. Golden and R.T. Wong, Capacitated Arc Routing Problems, Networks 11: 305–315 (1981).

    MathSciNet  MATH  Google Scholar 

  28. M. Grötschel and Z. Win, A Cutting Plane Algorithm for the Windy Postman Problem, Mathematical Programming 55: 339–358 (1992).

    MathSciNet  MATH  Google Scholar 

  29. P. Hansen and N. Mladenović, An Introduction to VNS. In S. Voss, S. Martello, I.H. Osman and C. Roucairol (eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publishers, Boston, (1998).

    Google Scholar 

  30. A. Hertz, G. Laporte and M. Mittaz, A Tabu Search Heuristic for the Capacitated Arc Routing Problem, Operations Research 48: 129–135 (2000).

    Article  MathSciNet  MATH  Google Scholar 

  31. A. Hertz, G. Laporte and P. Nanchen-Hugo, Improvement Procedure for the Undirected Rural Postman Problem, INFORMS Journal on Computing 11: 53–62 (1999).

    Article  MathSciNet  MATH  Google Scholar 

  32. A. Hertz and M. Mittaz, A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem, Transportation Science 35: 425–434 (2001).

    Article  MATH  Google Scholar 

  33. R. Hirabayashi, Y. Saruwatari and N. Nishida, Tour Construction Algorithm for the Capacitated Arc Routing Problem, Asia-Pacific Journal of Operational Research 9: 155–175 (1992).

    MathSciNet  MATH  Google Scholar 

  34. S. Kirkpatrick, C.D. Gelatt and M. Vecchi, M. Optimization by Simulated Annealing, Science 220: 671–680 (1983).

    MathSciNet  Google Scholar 

  35. J.K. Lenstra and A.H.G. Rinnooy Kan, On General Routing Problems, Networks 6: 273–280 (1976).

    MathSciNet  MATH  Google Scholar 

  36. A.N. Letchford, Polyhedral Results for some Constrained Arc Routing Problems, PhD Dissertation, Dept. of Management Science, Lancaster University, (1997).

    Google Scholar 

  37. S. Martello and P. Toth, Lower Bounds and Reduction Procedures for the Bin Packing Problem, Discrete Applied Mathematics 28: 59–70 (1990).

    Article  MathSciNet  MATH  Google Scholar 

  38. M. Mittaz, Problèmes de Cheminements Optimaux dans des Réseaux avec Contraintes Associées aux Arcs, PhD Dissertation, Department of Mathematics, Ecole Polytechnique Fédérale de Lausanne, (1999).

    Google Scholar 

  39. N. Mladenović and P. Hansen, Variable Neigbhourhood Search, Computers & Operations Research 34: 1097–1100 (1997).

    Google Scholar 

  40. C.S. Orloff, A Fundamental Problem in Vehicle Rouring, Networks 4: 35–64 (1974).

    MATH  MathSciNet  Google Scholar 

  41. M.W. Padberg and M.R. Rao, Odd Minimum Cut-Setss and b-Matchings, Mathematics for Operations Research 7: 67–80 (1982).

    MathSciNet  MATH  Google Scholar 

  42. M.W. Padberg and G. Rinaldi, A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems, SIAM Review 33: 60–100 (1991).

    Article  MathSciNet  MATH  Google Scholar 

  43. W.-L. Pearn, Approximate Solutions for the Capacitated Arc Routing Problem, Computers & Operations Research 16: 589–600 (1989).

    Article  MATH  MathSciNet  Google Scholar 

  44. S. Roy and J.M. Rousseau, The Capacitated Canadian Postman Problem, INFOR 27: 58–73 (1989).

    MATH  Google Scholar 

  45. L.A. Wolsey, Integer Programming, John Wiley & Sons, (1998).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département de Mathématiques et de génie industriel, Ecole Polytechnique - GERAD, CP 6079, succ. Centre-ville, Montréal, QC, H3C 3A7, Canada

    Alain Hertz

Authors
  1. Alain Hertz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Haifa, Israel

    Martin Charles Golumbic  & Irith Ben-Arroyo Hartman  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science + Business Media, Inc.

About this chapter

Cite this chapter

Hertz, A. (2005). Recent Trends in Arc Routing. In: Golumbic, M.C., Hartman, I.BA. (eds) Graph Theory, Combinatorics and Algorithms. Operations Research/Computer Science Interfaces Series, vol 34. Springer, Boston, MA. https://doi.org/10.1007/0-387-25036-0_9

Download citation

Publish with us

Policies and ethics

Search

Navigation