A decade of Capacitated Arc Routing

Operations Research/ Computer Science Interfaces Series

Volumn 43, Issue , 2008, Pages 29-48

  Wøhlk, Sanne ^a  

^a AARHUS SCHOOL OF BUSINESS   (Denmark)

Author keywords

Arc routing; CARP; Recent research

Indexed keywords

EID: 84864469316     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-77778-8_2     Document Type: Article

References (93)

1. D. Ahr. Contributions to multiple postmen problems. PhD thesis, University of Heidelberg, 2004.
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.
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.
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.
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.
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.
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.
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.
9. J. Aráoz, E. Fernández, and C. Zoltan. Privatized rural postman problem. Computers and Operations Research, 33(12): 3432-3449, 2006.
10. A. A. Assad and B. L. Golden. Arc routing methods and applications, in Handbooks 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.
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.
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.
13. R. Baldacci and V. Maniezzo. Exact methods based on node routing formulations for undirected arc routing problems. Networks, 47(1): 52-60, 2006.
14. M. Ball, L. Bodin, L. Levy, and J. Sniezek. Capacitated arc routing problem with vehicle-site dependencies: The Philadelphia experience, in The vehicle routing problem. Paolo Toth and Daniele Vigo, 2001.
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.
16. J. M. Belenguer. http://www. uv. es/-belengue/carp. html.
17. J. M. Belenguer. http://www. uv. es/-belengue/mcarp/index. html.
18. J. M. Belenguer and E. Benavent. The capacitated arc routing problem: Valid inequalities and facets. Computational Optimization and Applications, 10: 165-187, 1998.
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.
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.
21. E. Benavent, A. Corberán, and J. M. Sanchis. Linear programming based methods for solving arc routing problems, in Arc routing-Theory, solutions and applications. M. Dror, editor. Kluwer Academic Publishers, 2000.
22. E. Benavent, V. Campos, A. Corberán, and E. Mota. The capacitated arc routing problem: Lower bounds. Networks, 22: 669-690, 1992.
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.
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.
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.
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.
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.
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.
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.
30. D. Cattrysse, L. Muyldermans, and D. Van Oudheusden. District design for arcrouting applications. Journal of the Operational Research Society, 54: 1209-1221, 2003.
31. N. Christofides. The optimum traversal of a graph. OMEGA, The International Journal of Management Science, 1(6): 719-732, 1973.
32. F. Chu, N. Labadi, and C. Prins. Lower bounds for the periodic capacitated arc routing problem The Odysseus 2003 conference, 2003.
33. F. Chu, N. Labadi, and C. Prins. Heuristics for the periodic capacitated arc routing problem. Journal of Intelligent Manufacturing, 16: 243-251, 2005.
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.
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.
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.
37. M. Dror, editor. Arc routing-Theory, solutions and applications. Kluwer Academic Publishers, 2000.
38. M. Dror, H. I. Stern, and P. Trudeau. Postman tour on a graph with precedence relation on arcs. Networks, 17: 283-294, 1987.
39. J. Edmonds and E. L. Johnson. Matching, euler tours and the chinese postman. Mathematical Programming, 5(1): 88-124, 1973.
40. R. W. Eglese. Routing winter gritting vehicle. Discrete Applied Mathematics, 48: 231-244, 1994.
41. R. W. Eglese and A. N. Letchford. The rural postman problem with deadline classes. European Journal of Operational Research, 105: 390-400, 1998.
42. R. W. Eglese and A. N. Letchford. Polyhedral theory for arc routing problems, in Arc routing-Theory, solutions and applications. M. Dror, editor. Kluwer Academic Publishers, 2000.
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.
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.
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.
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.
47. G. Fleury, P. Lacomme, and C. Prins. Evolutionary algorithms for stochastic arc routing problems. Lecture Notes in Computer Science, 3005: 501-512, 2004.
48. G. Fleury, P. Lacomme, and C. Prins. Stochastic capacitated arc routing problems. Research Report LIMOS/RR-05-12, 2005.
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.
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.
51. M. Fleury. Deux problemes de geometrie de situation. Journal de Mathematiques Elementaires, pages 257-261, 1883.
52. G. N. Frederickson. Approximation algorithms for some postman problems. Journal of Association fot Computing Machinery, 26(3): 538-554, 1979.
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.
54. M. Gendreau, J. Y. Potvin, and M. Tagmouti. Arc routing problems with timedependent service costs. European Journal of Operational Research, 181(1): 30-39, 2007.
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.
56. G. Ghiani, G. Improta, and G. Laporte. The capacitated arc routing problem with intermediate facilities. Networks, 37(3): 134-143, 2001.
57. F. W. Glover and G. A. Kochenberger, editors. Handbook of metaheuristics. Kluwer Academic Publishers, 2003.
58. B. L. Golden and R. T. Wong. Capacitated arc routing problems. Networks, 11: 305-315, 1981.
59. P. Greistorfer. A tabu scatter search metaheuristic for the arc routing problem. Computers and Industrial Engineering, 44(2): 249-266, 2003.
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.
61. A. Hertz. Recent Trends in Arc Routing. in Graph theory, Combinatorics and algorithms: Operations research/computer science interfaces series, M. C. Golumbic and I. B. A Hartman. 2005.
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.
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.
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.
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.
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.
67. K. Jansen. An approximation algorithm for the general routing problem. Information Processing Letters, 41: 333-339, 1992.
68. A. H. G. Rinnooy Kan and J. K. Lenstra. On general routing problems. Networks, 6: 273-280, 1976.
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.
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.
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.
72. Philippe Lacomme, Christian Prins, and Wahiba Ramdana-Chérif. An integer linear model for general routing problems. Technical Report., 2003.
73. Philippe Lacomme, Christian Prins, andWahiba Ramdana-Chérif. Evolutionary algorithms for periodic arc routing problems. European Journal of Operational Research, 165: 535-553, 2005.
74. Philippe Lacomme, Christian Prins, and Wahiba Ramdane-Cherif. Competitive memetic algorithms for arc routing problems. Annals of Operations Research, 131: 159-185, 2004.
75. Philippe Lacomme, Christian Prins, and Marc Sevaux. Multiobjective capacitated arc routing problem. Lecture Notes in computer Science, 2632: 550-564, 2003.
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.
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.
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.
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.
80. Arne Løkketangen and Johan Oppen. Arc routing in a node routing environment. Computers and Operations Research, 33(4): 1033-1055, 2006.
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.
82. Kwan Mei-Ko. Graphic programming using odd or even points. Chinese Mathematics, 1: 237-277, 1962.
83. E. Minieka. The chinese postman problem for mixed networks. Management Science, 25: 643-648, 1979.
84. C. S. Orloff. A fundamental problem in vehicle routing. Networks, 4: 35-64, 1974.
85. Christos H. Papadimitriou. On the complexity of edge traversing. Journal of the Association for Computing Machinery, 23(3), 1976.
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.
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.
88. Gunduz Ulusoy. The fleet size and mix problem for capaciteted arc routing. European Journal of Operational Research, 22: 329-337, 1985.
89. Scott Allen Welz. Optimal solutions for the capacitated arc routing problem using integer programming. PhD thesis, University of Cincinnati, 1994.
90. Zaw Win. Contributions to routing problems. PhD thesis, University of Augsburg, 1988.
91. Sanne Wøhlk. http://www. wohlk-son. dk/sanne/research carptw. html.
92. Sanne Wøhlk. Contributins to arc routing. PhD thesis, University of Southern Denmark, 2005.
93. Sanne Wøhlk. New lower bound for the capacitated arc routing problem. Computers and Operations Research, 33(12): 3458-3472, 2006.