Skip to main content
SpringerLink
Log in

A Decade of Capacitated Arc Routing

  • Chapter
The Vehicle Routing Problem: Latest Advances and New Challenges

Part of the book series: Operations Research/Computer Science Interfaces ((ORCS,volume 43))

Summary

Arc Routing is the arc counterpart to node routing in the sense that focus regarding service and resource constraints are on the arcs and not on the nodes. The key problem within this area is the Capacitated Arc Routing Problem (CARP), which is the arc routing counterpart to the vehicle routing problem. During the last decade, arc routing has been a relatively active research area with respect to lower bounding procedures, solution approaches and modeling. Furthermore, several interesting variations of the problem have been studied. We survey the latest research within the area of arc routing focusing mainly on the CARP and its variants.

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 219.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 279.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 379.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. D. Ahr. Contributions to multiple postmen problems.PhD thesis, University of Heidelberg, 2004.

    Google Scholar 

  2. D. Ahr and G. Reinelt. A tabu search algorithm for the min-max k-chinese postman problem.Computers and Operations Research, 33(12):3403–3422, 2006.

    Article  Google Scholar 

  3. M.T. Almeida and M.C. Mourão. Lower-bounding and heuristic methods for a refuse collection vehicle routing problem.European Journal of Operational Research, 121:420–434, 2000.

    Article  Google Scholar 

  4. L. Amado and M.C. Mourão. Heuristic method for a mixed capacitated arc routing problem: A refuse collection application.European Journal of Operational Research, 160(1):139–153, 2005.

    Article  Google Scholar 

  5. A. Amaya, A. Langevin, and M. Trépanier. The capacitated arc routing problem with refill points.Operations Research Letters, 35(1):45–53, 2007.

    Article  Google Scholar 

  6. A. Amberg, W. Domschke, and S. Voß. Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees.European Journal of Operational Research, 124:360–376, 2000.

    Article  Google Scholar 

  7. A. Amberg and S. Voß. A hierarchical relaxations lower bound for the capacitated arc routing roblem.Proceedings of the 35th Annual Hawaii International Conference on System Sciences, 3, 2002.

    Google Scholar 

  8. S.K. Amponsah and S. Salhi. The investigation of a class of capacitated arc routing problems: The collection of garbage in developing countries.Waste Management, 24:711–721, 2004.

    Article  Google Scholar 

  9. J. Aráoz, E. Fernández, and C. Zoltan. Privatized rural postman problem.Computers and Operations Research, 33(12):3432–3449, 2006.

    Article  Google Scholar 

  10. A.A. Assad and B.L. Golden. Arc routing methods and applications, inHandbooks in operations research and management science, Volume 8 - Network routing, pages 375–483. Michael O. Ball and T.L. Magnanti and C.L. Monma and George L. Nemhauser, 1995.

    Google Scholar 

  11. A.A. Assad, B.L. Golden, and W.L. Pearn. Transforming arc routing into node routing problems.Computers and Operations Research, 14(4):285–288, 1987.

    Article  Google Scholar 

  12. E.K. Baker, J.S. DeArmon, and B.L. Golden. Computational experiments with algorithms for a class of routing problems.Computers and Operations Research, 10(1):47–59, 1983.

    Article  Google Scholar 

  13. R. Baldacci and V. Maniezzo. Exact methods based on node routing formulations for undirected arc routing problems.Networks, 47(1):52–60, 2006.

    Article  Google Scholar 

  14. M. Ball, L. Bodin, L. Levy, and J. Sniezek. Capacitated arc routing problem with vehicle-site dependencies: The Philadelphia experience, inThe vehicle routing problem. Paolo Toth and Daniele Vigo, 2001.

    Google Scholar 

  15. J.M. Belenguer, E. Benavent, P. Lacomme, and C. Prins. Lower and upper bounds for the mixed capacitated arc routing problem.Computers and Operations Research, 33(12):3363–3383, 2006.

    Article  Google Scholar 

  16. J.M. Belenguer. http://www.uv.es/belengue/carp.html.

    Google Scholar 

  17. J.M. Belenguer. http://www.uv.es/belengue/mcarp/index.html.

    Google Scholar 

  18. J.M. Belenguer and E. Benavent. The capacitated arc routing problem: Valid inequalities and facets.Computational Optimization and Applications, 10:165–187, 1998.

    Article  Google Scholar 

  19. J.M. Belenguer and E. Benavent. A cutting plane algorithm for the capacitated arc routing problem.Computers and Operations Research, 30(5):705–728, 2003.

    Article  Google Scholar 

  20. J.M. Belenguer, E. Benavent, and D. Gómez-Cabrero. Cutting plane and column generation for the capacitated arc routing problem.ORP3 Meeting, Valencia, 2005.

    Google Scholar 

  21. E. Benavent, A. Corberán, and J.M. Sanchis. Linear programming based methods for solving arc routing problems, inArc routing - Theory, solutions and applications. M. Dror, editor. Kluwer Academic Publishers, 2000.

    Google Scholar 

  22. E. Benavent, V. Campos, A. Corberán, and E. Mota. The capacitated arc routing problem: Lower bounds.Networks, 22:669–690, 1992.

    Article  Google Scholar 

  23. P. Beullens, D. Cattrysse, L. Muyldermans, and D. Van Oudheusden. A guided local search heuristic for the capacitated arc routing problem.European Journal of Operational Research, 147:629–643, 2003.

    Article  Google Scholar 

  24. L. Bodin and J. Sniezek. Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles.Annals of Operations Research, 144(1):33–58, 2006.

    Article  Google Scholar 

  25. L.D. Bodin and S.J. Kursh. A computer-assisted system for the routing and scheduling of street sweepers.Operations Research, 26(4):525–537, 1987.

    Article  Google Scholar 

  26. J. Brandâo and R.W. Eglese. A deterministic tabu search algorithm for the capacitated arc routing problem (CARP).Computers and Operations Research, to appear.

    Google Scholar 

  27. J.F. Campbell, A. Langevin, and N. Perrier. A survey of models and algorithms for winter road maintenance. Part III: Vehicle routing and depot location for spreading.Computers and Operations Research, 34(1):211–257, 2007.

    Article  Google Scholar 

  28. J.F. Campbell, A. Langevin, and N. Perrier. A survey of models and algorithms for winter road maintenance. Part IV: Vehicle routing and fleet sizing for plowing and snow disposal.Computers and Operations Research, 34(1):258–294, 2007.

    Article  Google Scholar 

  29. D. Cattrysse, T. Lotan, L. Muyldermans, and D. Van Oudheusden. Districting for salt spreading operations.European Journal of Operational Research, 139:521–532, 2002.

    Article  Google Scholar 

  30. D. Cattrysse, L. Muyldermans, and D. Van Oudheusden. District design for arc-routing applications.Journal of the Operational Research Society, 54:1209–1221, 2003.

    Article  Google Scholar 

  31. N. Christofides. The optimum traversal of a graph.OMEGA, The International Journal of Management Science, 1(6):719–732, 1973.

    Article  Google Scholar 

  32. F. Chu, N. Labadi, and C. Prins. Lower bounds for the periodic capacitated arc routing problemThe Odysseus 2003 conference, 2003.

    Google Scholar 

  33. F. Chu, N. Labadi, and C. Prins. Heuristics for the periodic capacitated arc routing problem.Journal of Intelligent Manufacturing, 16:243–251, 2005.

    Article  Google Scholar 

  34. F. Chu, N. Labadi, and C. Prins. A scatter search for the periodic capacitated arc routing problem.European Journal of Operational Research, 169(2):586–605, 2006.

    Article  Google Scholar 

  35. M. P de Aragão, H. Longo, and E. Uchoa. Solving capacitated arc routing problem using a transformation to the CVRP.Computers and Operations Research, 33(6):1823–1837, 2006.

    Article  Google Scholar 

  36. K.F. Doerner, R.F. Hartl, V. Maniezzo, and M. Reimann. An ant system metaheuristic for the capacitated arc routing problem.Preprints of 5th Metaheuristics International Conference, Kyoto, 2003.

    Google Scholar 

  37. M. Dror, editor. Arc routing - Theory, solutions and applications.Kluwer Academic Publishers, 2000.

    Google Scholar 

  38. M. Dror, H.I. Stern, and P. Trudeau. Postman tour on a graph with precedence relation on arcs.Networks, 17:283–294, 1987.

    Article  Google Scholar 

  39. J. Edmonds and E.L. Johnson. Matching, euler tours and the chinese postman.Mathematical Programming, 5(1):88–124, 1973.

    Article  Google Scholar 

  40. R.W. Eglese. Routing winter gritting vehicle.Discrete Applied Mathematics, 48:231–244, 1994.

    Article  Google Scholar 

  41. R.W. Eglese and A.N. Letchford. The rural postman problem with deadline classes.European Journal of Operational Research, 105:390–400, 1998.

    Article  Google Scholar 

  42. R.W. Eglese and A.N. Letchford. Polyhedral theory for arc routing problems, inArc routing - Theory, solutions and applications. M. Dror, editor. Kluwer Academic Publishers, 2000.

    Google Scholar 

  43. R.W. Eglese and L.Y.O. Li. An interactive algorithm for vehicle routeing for winter-gritting.Journal of the Operational Research Society, 47:pp. 217–228, 1996.

    Google Scholar 

  44. H.A. Eiselt, M. Gendreau, and G. Laporte. Arc routing problems, Part 1: The chinese postman problem.Operations Research, 43(2):231–242, 1995.

    Google Scholar 

  45. H.A. Eiselt, M. Gendreau, and G. Laporte. Arc routing problems, Part 2: The rural postman problem.Operations Research, 43(3):399–414, 1995.

    Article  Google Scholar 

  46. C. Filippi and A. Del Pia. A variable neighborhood descent algorithm for a real waste collection problem with mobile depots.International Transactions in Operational Research, 13:125–141, 2006.

    Article  Google Scholar 

  47. G. Fleury, P. Lacomme, and C. Prins. Evolutionary algorithms for stochastic arc routing problems.Lecture Notes in Computer Science, 3005:501–512, 2004.

    Google Scholar 

  48. G. Fleury, P. Lacomme, and C. Prins. Stochastic capacitated arc routing problems.Research Report LIMOS/RR-05-12, 2005.

    Google Scholar 

  49. G. Fleury, P. Lacomme, C. Prins, and W. Ramdana-Chérif. Robustness evaluation of solutions for the capacitated arc routing problem.Conference, AI Simulation and Planning in High Autonomy Systems. ISBN 1-56555-242-3, pages 290–295, 2002.

    Google Scholar 

  50. G. Fleury, P. Lacomme, C. Prins, and W. Ramdane-Cherif. Improving robustness of solutions to arc routing problems.Journal of the Operational Research Society, 56:526–538, 2005.

    Article  Google Scholar 

  51. M. Fleury. Deux problemes de geometrie de situation.Journal de Mathematiques Elementaires, pages 257–261, 1883.

    Google Scholar 

  52. G.N. Frederickson. Approximation algorithms for some postman problems.Journal of Association fot Computing Machinery, 26(3):538–554, 1979.

    Google Scholar 

  53. G.N. Frederickson, M.S. Hecht, and C.E. Kim. Approximation algorithms for some routing problems.SIAM Journal of Computing, 7(2):178–193, 1978.

    Article  Google Scholar 

  54. M. Gendreau, J.Y. Potvin, and M. Tagmouti. Arc routing problems with time-dependent service costs.European Journal of Operational Research, 181(1):30–39, 2007.

    Article  Google Scholar 

  55. G. Ghiani, F. Guerriero, G. Improta, and R. Musmanno. Waste collection in southern Italy: Solution of a real-life arc routing problem.International Transactions in Operational Research, 12:135–144, 2005.

    Article  Google Scholar 

  56. G. Ghiani, G. Improta, and G. Laporte. The capacitated arc routing problem with intermediate facilities.Networks, 37(3):134–143, 2001.

    Article  Google Scholar 

  57. F.W. Glover and G.A. Kochenberger, editors. Handbook of metaheuristics.Kluwer Academic Publishers, 2003.

    Google Scholar 

  58. B.L. Golden and R.T. Wong. Capacitated arc routing problems.Networks, 11:305–315, 1981.

    Article  Google Scholar 

  59. P. Greistorfer. A tabu scatter search metaheuristic for the arc routing problem.Computers and Industrial Engineering, 44(2):249–266, 2003.

    Article  Google Scholar 

  60. P. Haastrup, V. Maniezzo, M. Mattarelli, F. Mazzeo Rinaldi, I. Mendes, and M. Paruccini. A decision support system for urban waste management.European Journal of Operational Research, 109:330–341, 1998.

    Article  Google Scholar 

  61. A. Hertz. Recent Trends in Arc Routing. inGraph theory, Combinatorics and algorithms: Operations research/computer science interfaces series, M.C. Golumbic and I.B.A Hartman. 2005.

    Google Scholar 

  62. A. Hertz, G. Laporte, and M. Mittaz. A tabu search heuristic for the capacitated arc routing problem.Operations Research, 48(1):129–135, 2000.

    Article  Google Scholar 

  63. A. Hertz, G. Laporte, and P. Nanchen-Hugo. Improvement procedures for the undirected rural postman problem.INFORMS Journal of Computing, 11(1):53–62, 1999.

    Google Scholar 

  64. A. Hertz and M. Mittaz. A variable neighborhood descent algorithm for the undirected capacitated arc routing problem.Transportation Science, 35(4):425–434, 2001.

    Article  Google Scholar 

  65. R. Hirabayashi, N. Nishida, and Y. Saruwatari. Node duplication lower bounds for the capacitated arc routing problems.Journal of the Operations Research Society of Japan, 35(2):119–133, 1992.

    Google Scholar 

  66. R. Hirabayashi, N. Nishida, and Y. Saruwatari. Tour construction algorithm for the capacitated arc routing problem.Asia-Pacific Journal of Operational Research, 9:155–175, 1992.

    Google Scholar 

  67. K. Jansen. An approximation algorithm for the general routing problem.Information Processing Letters, 41:333–339, 1992.

    Article  Google Scholar 

  68. A.H.G. Rinnooy Kan and J.K. Lenstra. On general routing problems.Networks, 6:273–280, 1976.

    Article  Google Scholar 

  69. M. Kiuchi, R. Hirabayashi, Y. Saruwatari, and Y. Shinano. An exact algorithm for the capacitated arc routing problem using parallel branch and bound method.Abstracts of the 1995 Spring National Conference of the Oper. Res. Soc. of Japan, pages pp. 28–29, 1995.

    Google Scholar 

  70. N. Labadi, C. Prins, and M. Reghioui. GRASP with path relinking for the capacitated arc routing problem with time windows.Lecture Notes in Computer Science, 4448:722–731, 2007.

    Article  Google Scholar 

  71. P. Lacomme, C. Prins, and W. Ramdana-Chérif. Competitive genetic algorithms for the capacitated arc routing problem and its extensions.Lecture Notes in Computer Science, 2037:473–483, 2001.

    Article  Google Scholar 

  72. Philippe Lacomme, Christian Prins, and Wahiba Ramdana-Chérif. An integer linear model for general routing problems.Technical Report., 2003.

    Google Scholar 

  73. Philippe Lacomme, Christian Prins, and Wahiba Ramdana-Chérif. Evolutionary algorithms for periodic arc routing problems.European Journal of Operational Research, 165:535–553, 2005.

    Google Scholar 

  74. Philippe Lacomme, Christian Prins, and Wahiba Ramdane-Cherif. Competitive memetic algorithms for arc routing problems.Annals of Operations Research, 131:159–185, 2004.

    Google Scholar 

  75. Philippe Lacomme, Christian Prins, and Marc Sevaux. Multiobjective capacitated arc routing problem.Lecture Notes in computer Science, 2632:550–564, 2003.

    Google Scholar 

  76. Philippe Lacomme, Christian Prins, and Marc Sevaux. A genetic algorithm for a bi-objective capacitated arc routing problem.Computers and Operations Research, 33(12):3473–3493, 2006.

    Article  Google Scholar 

  77. Philippe Lacomme, Christian Prins, and Alain Tanguy. First competitive ant colony scheme for the CARP.Lecture Notes in Computer Science, 3172:426–427, 2004.

    Google Scholar 

  78. André Langevin, Fabien Marzolf, and Marting Trépanier. Road network monitoring: Algorithms and a case study.Computers and Operations Research, 33(12):3494–3507, 2006.

    Article  Google Scholar 

  79. Adam N. Letchford and Amar Oukil. Exploiting sparsity in pricing routines for the capacitated arc routing problem.Working paper, Department of Management Science, Lancaster University, 2006.

    Google Scholar 

  80. Arne Løkketangen and Johan Oppen. Arc routing in a node routing environment.Computers and Operations Research, 33(4):1033–1055, 2006.

    Article  Google Scholar 

  81. Renata Mansini and M. Grazia Speranza. A linear programming model for the separate refuse collection service.Computers and Operations Research, 25(7/8):659–673, 1998.

    Google Scholar 

  82. Kwan Mei-Ko. Graphic programming using odd or even points.Chinese Mathematics, 1:237–277, 1962.

    Google Scholar 

  83. E. Minieka. The chinese postman problem for mixed networks.Management Science, 25:643–648, 1979.

    Google Scholar 

  84. C.S. Orloff. A fundamental problem in vehicle routing.Networks, 4:35–64, 1974.

    Article  Google Scholar 

  85. Christos H. Papadimitriou. On the complexity of edge traversing.Journal of the Association for Computing Machinery, 23(3), 1976.

    Google Scholar 

  86. Horst Sachs, Michael Stiebitz, and Robin J. Wilson. An historical note: Euler’s Königberg letters.Journal of Graph Theory, 12(1):133–139, 1988.

    Article  Google Scholar 

  87. John Sniezek. The capacitated arc routing problem with vehicle/site dependencies: An application of arc routing and partitioning.PhD thesis, University of Maryland, 2001.

    Google Scholar 

  88. Gunduz Ulusoy. The fleet size and mix problem for capaciteted arc routing.European Journal of Operational Research, 22:329–337, 1985.

    Article  Google Scholar 

  89. Scott Allen Welz. Optimal solutions for the capacitated arc routing problem using integer programming.PhD thesis, University of Cincinnati, 1994.

    Google Scholar 

  90. Zaw Win. Contributions to routing problems.PhD thesis, University of Augsburg, 1988.

    Google Scholar 

  91. Sanne Wøhlk. http://www.wohlk-son.dk/sanne/research_carptw.html.

    Google Scholar 

  92. Sanne Wøhlk. Contributins to arc routing.PhD thesis, University of Southern Denmark, 2005.

    Google Scholar 

  93. Sanne Wøhlk. New lower bound for the capacitated arc routing problem.Computers and Operations Research, 33(12):3458–3472, 2006.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Business Studies, Aarhus School of Business, Aarhus University, Denmark

    Sanne Wøhlk

Authors
  1. Sanne Wøhlk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sanne Wøhlk .

Editor information

Editors and Affiliations

  1. University of Maryland, College Park, MD, USA

    Bruce Golden  & S. Raghavan  & 

  2. American University, Washington, DC, USA

    Edward Wasil

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Wøhlk, S. (2008). A Decade of Capacitated Arc Routing. In: Golden, B., Raghavan, S., Wasil, E. (eds) The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-77778-8_2

Download citation

Publish with us

Policies and ethics

Search

Navigation