An improved heuristic for the capacitated arc routing problem

Computers and Operations Research

Volumn 36, Issue 9, 2009, Pages 2632-2637

  Santos, Luís ^a,c   Coutinho Rodrigues, João ^a,c   Current, John R ^b,c  

^a UNIVERSITY OF COIMBRA   (Portugal)

^b OHIO STATE UNIVERSITY   (United States)

^c INESC COIMBRA   (Portugal)

Author keywords

Capacitated arc routing problem; Heuristics; Vehicle routing

Indexed keywords

CAVITY RESONATORS; CONTROL THEORY; SCANNING; VEHICLE ROUTING; VEHICLES;

AVERAGE DISTANCES; CAPACITATED ARC ROUTING PROBLEM; CAPACITY CONSTRAINTS; DATA-SETS; HEURISTICS; LOWER BOUNDS; META-HEURISTIC; META-HEURISTICS; NEW APPROACHES; NP-HARD PROBLEMS; PATH-SCANNING; PRACTICAL PROBLEMS; SOLUTION APPROACHES; TEST PROBLEMS; TOTAL COSTS;

HEURISTIC METHODS;

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

References (22)

1. MacroSys Research and Technology. Logistics costs and U.S. gross domestic product. Federal Highway Administration Department of Transportation; 2005, August 25 〈http://ops.fhwa.dot.gov/freight/freight_analysis/econ_methods/lcdp_rep/index.htm〉.
2. Assad A.A., and Golden B.L. Arc routing methods and applications. In: Ball M.O., et al. (Ed). Handbook in operations research and management science vol. 8 (1995), Elsevier 375-483
3. Dror M. Arc routing: theory, solutions and applications (2000), Kluwer Academic Publishers, MA
4. Santos L., Coutinho-Rodrigues J., and Current J.R. Implementing a multi-vehicle multi-route spatial decision support system for efficient trash collection in Portugal. Transportation Research Part A: Policy and Practice 42 6 (2008) 922-934
5. Golden B.L., and Wong R.T. Capacitated arc routing problems. Networks 11 (1981) 305-315
6. Hirabayashi R., Saruwatari Y., and Nishida N. Tour construction algorithm for the capacitated arc routing problems. Asia-Pacific Journal Operations Research 9 (1992) 155-175
7. Longo H., Aragão M.P., and Uchoa E. Solving capacitated arc routing problems using a transformation to the CVRP. Computers and Operations Research 33 (2006) 1823-1837
8. Golden B.L., DeArmon J., and Baker E.K. Computational experiments with algorithms for a class of routing problems. Computers and Operations Research 10 (1983) 47-59
9. Pearn W.L. Approximate solutions for the capacitated arc routing problem. Computers and Operations Research 16 (1989) 589-600
10. Benavent E., Campos V., Corberán A., and Mota E. The capacitated arc routing problem: lower bounds. Networks 22 (1992) 669-690
11. Belenguer J.M., and Benavent E. A cutting plane algorithm for the capacitated arc routing problem. Computers and Operations Research 30 5 (2003) 705-728
12. Coutinho-Rodrigues J., Rodrigues N., and Clímaco J. Solving an urban routing problem using heuristics: a successful case study. Belgian Journal of Operations Research, Statistics and Computer Science, Combinatorial Optimization in Applications 33 (1993) 19-32 [special issue]
13. Hertz A., Laporte G., and Mittaz M. A tabu search heuristic for the capacitated arc routing problem. Operations Research 48 (2000) 129-135
14. Greistorfer P. A tabu scatter search metaheuristic for the capacitated arc routing problem. Computers and Industrial Engineering 44 2 (2003) 249-266
15. Lacomme P., Prins C., and Ramdane-chérif W. Competitive memetic algorithms for arc routing problems. Annals of Operations Research 131 (2004) 159-185
16. Lacomme P, Prins C, Tanguy A. First competitive ant colony scheme for the CARP. Research Report LIMOS/RR-04-21; 2004 〈http://www.isima.fr/limos/publi/RR-04-21.pdf〉.
17. Belenguer J.M., Benavent E., Lacomme P., and Prins C. Lower and upper bounds for the mixed capacitated arc routing problem. Computers and Operations Research 33 (2006) 3363-3383
18. Greistorfer P. Computational experiments with heuristics for a capacitated arc routing problem. In: Derigs U., Bachem A., and Drexl A. (Eds). Operations research proceedings, 1994 (1995), Springer, Berlin 185-190
19. Evans J., and Minieka E. Optimization algorithms for networks and graphs. second ed. (1992), Marcel Dekker, New York
20. Norback J.P., and Love R.F. Geometric approaches to solving the traveling salesman problem. Management Science 23 11 (1977) 1208-1223
21. DeArmon JS. A comparison of heuristics for the capacitated Chinese postman problem. Master's thesis, University of Maryland at College Park; 1981.
22. Li L.Y.O., and Eglese R.W. An interactive algorithm for vehicle routeing for winter-gritting. Journal of the Operational Research Society 47 (1996) 217-228