An improved ant colony optimization based algorithm for the capacitated arc routing problem

Transportation Research Part B: Methodological

Volumn 44, Issue 2, 2010, Pages 246-266

  Santos, Luís ^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

Ant colony optimization; Capacitated arc routing; Metaheuristics

Indexed keywords

ANT COLONY OPTIMIZATION; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; HEURISTIC ALGORITHMS; NETWORK ROUTING; ROUTING ALGORITHMS;

ARC ROUTING; CAPACITATED ARC ROUTING PROBLEM; DECISION RULES; IMPROVED ANT COLONY OPTIMIZATION; INITIAL POPULATION; META HEURISTICS; SOLUTION APPROACH; STATE OF THE ART;

OPTIMIZATION;

ALGORITHM; NUMERICAL MODEL; OPTIMIZATION; ROUTING;

EID: 73349137288     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2009.07.004     Document Type: Article

References (52)

1. Backer B., Furnon V., Shaw P., Kilby P., and Prosser P. Solving vehicle routing problems using constraint programming and metaheuristics. Journal of Heuristics 6 4 (2000) 501-523
2. Baldacci R., and Maniezzo V. Exact methods based on node-routing formulation for undirected arc-routing problems. Networks 47 1 (2006) 52-60
3. Bautista J., Fernández E., and Pereira J. Solving an urban waste collection problem using ants heuristics. Computers and Operations Research 35 9 (2008) 3020-3033
4. 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
5. Belenguer J.M., Benavent E., and Cognata F. Un metaheuristico para el problema de rutas por arcos con capacidades. 23rd National SEIO Meeting (1997), Valencia, Spain
6. 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 12 (2006) 3363-3383
7. Bell J., and McMullen P. Ant colony optimization techniques for the vehicle routing problem. Advanced Engineering Informatics 18 1 (2004) 41-48
8. Benavent E., Campos V., Corberán A., and Mota E. The capacitated arc routing problem: lower bounds. Networks 22 4 (1992) 669-690
9. Beullens P., Muyldermans L., Cattrysse D., and Oudheusden D. A guided local search heuristic for the capacitated arc routing problem. European Journal of Operational Research 147 3 (2003) 629-643
10. Blum C. Ant colony optimization: introduction and recent trends. Physics of Life Reviews 2 4 (2005) 353-373
11. Brandão J., and Eglese R. A deterministic tabu search algorithm for the capacitated arc routing problem. Computers and Operations Research 35 4 (2008) 1112-1126
12. Braysy O., and Gendreau M. Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transportation Science 39 1 (2005) 104-118
13. Braysy O., and Gendreau M. Vehicle routing problem with time windows, part II: metaheuristics. Transportation Science 39 1 (2005) 119-139
14. Bullnheimer B., Hartl R.F., and Strauss C. A new rank-based version of the ant system: a computational study. Central European Journal of Operations Research 7 1 (1999) 25-38
15. Clossey J., Laporte G., and Soriano P. Solving arc routing problems with turn penalties. Journal of the Operational Research Society 52 4 (2001) 433-439
16. 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 33 (1993) 19-32 (special issue on "Combinatorial Optimization in Applications")
17. DeArmon, J.S., 1981. A comparison of heuristics for the capacitated chinese postman problem. Master's thesis, University of Maryland at College Park.
18. Dial R. Algorithm 360: shortest path forest with topological ordering. Communications of the ACM 12 11 (1969) 632-633
19. Dijkstra E.W. A note on two problems with connection with graphs. Numerische Mathematik 1 5 (1959) 269-271
20. Dongarra, J.J., 2009. Performance of various computers using standard linear equations software. Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, TN.
21. Dorigo M., Caro G., and Gambardella L. Ant algorithms for discrete optimization. Artificial Life 5 2 (1999) 137-172
22. Dror M. Arc Routing: Theory, Solutions and Applications (2000), Kluwer Academic Publishers
23. Eglese R.W., and Li L.Y.O. A tabu search based heuristic for arc routing with a capacity constraint and time deadline. In: Osman I.H., and Kelly J.P. (Eds). Metaheuristics: Theory and Apllications (1996), Kluwer 633-650
24. Figliozzi M. Analysis of the efficiency of urban commercial vehicle torus: data collection, methodology, and policy implications. Transportation Research Part B 41 9 (2007) 1014-1032
25. Francis P., and Smilowitz K. Modeling techniques for periodic vehicle routing problems. Transportation Research Part B 40 10 (2006) 872-884
26. Golden B.L., and Wong R.T. Capacitated arc routing problems. Networks 11 3 (1981) 305-315
27. Golden B.L., DeArmon J., and Baker E.K. Computational experiments with algorithms for a class of routing problems. Computers and Operations Research 10 1 (1983) 47-59
28. Greistorfer P. A tabu scatter search metaheuristic for the capacitated arc routing problem. Computers and Industrial Engineering 44 2 (2003) 249-266
29. Hertz A., Laporte G., and Mittaz M. A tabu search heuristic for the capacitated arc routing problem. Operations Research 48 1 (2000) 129-135
30. Imai A., Nishimura E., and Current J. A Lagrangian relaxation-based heuristic for the vehicle routing with full container load. European Journal of Operational Research 176 1 (2007) 87-105
31. Lacomme P., Prins C., and Ramdane-Chérif W. A genetic algorithm for the CARP and its extensions. In: Boers E.J.W., et al. (Ed). Applications of Evolutionary Computing, Lecture Notes in Computer Science. vol. 2037 (2001), Springer 473-483
32. Lacomme P., Prins C., and Ramdane-Chérif W. Competitive memetic algorithms for arc routing problems. Annals of Operations Research 131 1 (2004) 159-185
33. Lacomme, P., Prins, C., Tanguy, A., 2004b. First competitive ant colony scheme for the CARP. Research Report LIMOS/RR-04-21. .
34. Li L.Y.O., and Eglese R.W. An interactive algorithm for vehicle routing for winter-gritting. Journal of the Operational Research Society 47 2 (1996) 217-228
35. 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 6 (2006) 1823-1837
36. MacroSys Research and Technology, 2005. Logistics costs and US gross domestic product. Federal Highway Administration Department of Transportation, August 25. .
37. Maniezzo V., Gambardella L.M., and De Luigi F. Ant colony optimization. In: Onwubolu G.C., and Babu B.V. (Eds). New Optimization Techniques in Engineering (2004), Springer-Verlag, Berlin, Heidelberg
38. Mazzeo S., and Loiseau I. An ant colony algorithm for the capacitated vehicle routing. Electronic Notes in Discrete Mathematics 18 12 (2004) 181-186
39. Ouyang Y.R. Design of vehicle routing zones for large-scale distribution systems. Transportation Research Part B 41 10 (2007) 1079-1093
40. Pearn, W.L., 1984. The capacitated Chinese postman problem. PhD Thesis, Maryland University.
41. Pearn W.L. Approximate solutions for the capacitated arc routing problem. Computers and Operations Research 16 6 (1989) 589-600
42. Polacek M., Doerner K.F., Hartl R.F., and Maniezzo V. A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. Journal of Heuristics 14 5 (2008) 405-423
43. Reimann M., and Ulrich H. Comparing backhauling strategies in vehicle routing using ant colony optimization. Central European Journal of Operations Research 14 2 (2006) 105-123
44. Reimann M., Doerner K., and Hartl R. D-ants: savings based ants divide and conquer the vehicle routing problem. Computers and Operations Research 31 4 (2004) 563-591
45. Rizzoli, A., Oliverio, F., Montemanni, R., Gambardella, L., 2004. Ant colony optimization for vehicle routing problems: from theory to applications. Tech report, IDSIA-15-04. .
46. Sankaran J., and Wood L. The relative impact of consignee behaviour and road traffic congestion on distribution costs. Transportation Research Part B 41 9 (2007) 1033-1049
47. Santos L., Coutinho-Rodrigues J., and Current J.R. An improved solution algorithm for the constrained shortest path problem. Transportation Research Part B 41 7 (2007) 756-771
48. 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 42 6 (2008) 922-934
49. Santos L., Coutinho-Rodrigues J., and Current J.R. An improved heuristic for the capacitated arc routing problem. Computers and Operations Research 36 9 (2009) 2632-2637
50. Steimetz S. Defensive driving and the external costs of accidents and travel delays. Transportation Research Part B 42 9 (2008) 703-724
51. Ulusoy G. The fleet size and mix problem for capacitated arc routing. European Journal of Operational Research 22 3 (1985) 329-337
52. Zobolas G.I., Tarantilis C.D., and Ioannou G. Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Computers Operations Research 36 4 (2009) 1249-1267