Lower and upper bounds for the mixed capacitated arc routing problem

Computers and Operations Research

Volumn 33, Issue 12, 2006, Pages 3363-3383

  Belenguer, José Manuel ^a   Benavent, Enrique ^a   Lacomme, Philippe ^b   Prins, Christian ^c  

^a UNIVERSITY OF VALENCIA   (Spain)

^b UNIVERSITÉ BLAISE PASCAL   (France)

^c UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

Capacitated arc routing problem; Cutting plane; Heuristic; Lower bound; Memetic algorithm; Mixed graph; Waste collection

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; LINEAR EQUATIONS; ROUTERS;

CAPACITATED ARC ROUTING PROBLEM; CUTTING PLANE; HEURISTIC; LOWER BOUND; MEMETIC ALGORITHM; MIXED GRAPH; WASTE COLLECTION;

PROBLEM SOLVING;

EID: 33645149426     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.02.009     Document Type: Article

References (24)

1. B.L. Golden, and R.T. Wong Capacitated arc routing problems Networks 11 1981 305 315
2. A.A. Assad, and B.L. Golden Arc routing methods and applications M.O. Ball Handbooks in OR and MS vol. 8 1995 Elsevier Amsterdam 375 483
3. R. Hirabayashi, Y. Saruwatari, and N. Nishida Tour construction algorithm for the capacitated arc routing problem Asia-Pacific Journal of Operational Research 9 1992 155 175
4. B.L. Golden, J.S. Dearmon, and E.K. Baker Computational experiments with algorithms for a class of routing problems Computers and Operations Research 10 1 1983 47 59
5. G. Ulusoy The fleet size and mix problem for capacitated arc routing European Journal of Operational Research 22 1985 329 337
6. R.W. Eglese, and L.Y.O. Li A tabu search based heuristic for arc routing with a capacity constraint and time deadline I.H. Osman J.P. Kelly Metaheuristics theory and applications 1996 Kluwer 633 650
7. A. Hertz, G. Laporte, and M. Mittaz A tabu search heuristic for the Capacitated Arc Routing Problem Operations Research 48 1 2000 129 135
8. Lacomme P, Prins C, Ramdane-Chérif W. A genetic algorithm for the capacitated arc routing problem and its extensions. In: Boers EJW, et al., editors. Applications of evolutionary computing. Lecture notes in computer science, vol. 2037. Berlin: Springer; 2001. p. 473-83.
9. Lacomme P, Prins C, Ramdane-Chérif W. Competitive memetic algorithms for arc routing problems, Research Report LOSI-2001-01, University of Technology of Troyes, France, 2001.
10. Annals of Operations Research 2004;131:159-85.
11. P. Greistorfer A tabu scatter search metaheuristic for the arc routing problem Computers and Industrial Engineering 44 2003 249 266
12. P. Beullens, L. Muyldermans, D. Cattrysse, and D. Van Oudheusden A guided local search heuristic for the capacitated arc routing problem European Journal of Operational Research 147 3 2003 629 643
13. J.M. Belenguer, and E. Benavent A cutting plane algorithm for the capacitated arc routing problem Computers and Operations Research 30 5 2003 705 728
14. Y. Nobert, and J.C. Picard An optimal algorithm for the mixed Chinese postman problem Networks 27 1996 95 108
15. A. Corberán, A. Romero, and J.M. Sanchis The mixed general routing polyhedron Mathematical Programming 96 2003 103 137
16. L.R. Ford, and D.R. Fulkerson Flows in networks 1962 Princeton University Press Princeton, NJ
17. E. Benavent, A. Corberán, and J.M. Sanchis Linear programming based methods for solving arc routing problems M. Dror Arc routing, theory, solutions and applications 2000 Kluwer Academic Publishers Boston 231 275
18. M.W. Padberg, and M.R. Rao Odd minimum cut-sets and b-matchings Mathematics of Operations Research 7 1982 67 80
19. E. Benavent, and D. Soler The directed Rural Postman Problem with turn penalties Transportation Science 33 4 1999 408 418
20. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to algorithms 2nd ed. 2001 The MIT Press Cambridge, MA
21. P. Moscato Memetic algorithms a short introduction D. Corne M. Dorigo F. Glover New ideas in optimization 1999 McGraw-Hill 219 234
22. Belenguer JM, Benavent E, Lacomme P, Prins C, Ramdane-Chérif W. Directory of MCARP instances, 2003. http://www.uv.es/ ∼ belengue/mcarp/ index.html.
23. Belenguer JM, Benavent E. Directory of UCARP instances, 1997. http://www.uv.es/ ∼ belengue/carp.html.
24. E. Benavent, V. Campos, A. Corberán, and E. Mota The Capacitated Arc Routing Problem lower bounds Networks 22 1992 669 690