A heuristic method for the capacitated arc routing problem with refill points and multiple loads

Journal of the Operational Research Society

Volumn 61, Issue 7, 2010, Pages 1095-1103

  Amaya, C A ^a   Langevin, A A ^b   Trepanier M M ^b  

^a UNIVERSIDAD DE LOS ANDES   (Colombia)

^b ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

Capacitated arc routing problem; Heuristics; Logistics; Networks and graphs; Optimization; Vehicle routing

Indexed keywords

LOGISTICS; NETWORK ROUTING; OPTIMIZATION; ROAD AND STREET MARKINGS; VEHICLE ROUTING; VEHICLES;

CAPACITATED ARC ROUTING PROBLEM; COMPUTATIONAL RESULTS; FINITE CAPACITY; HEURISTICS; NETWORKS AND GRAPHS; QUEBEC , CANADA; ROUTE-FIRST CLUSTER-SECOND HEURISTIC; SOLUTION PROCEDURE;

HEURISTIC METHODS;

EID: 77953678545     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2009.58     Document Type: Article

References (18)

1. Amaya CA, Langevin A and Tŕepanier M (2007). The capacitated arc routing problem with refill points. Opns Res Lett 35: 45-53.
2. Assad AA and Golden BL (1995). Arc routing methods and applications. In: Ball MO, Magnanti TL, Monma CL and Nemhauser GL (eds). Network Routing, Handbooks in Operations Research and Management Science. North-Holland: Amsterdam, The Netherlands, pp 375-483.
3. Belenguer JM and Benavent E (1998). The capacitated arc routing problem: Valid inequalities and facets. Comput Optim Appl 10: 165-187.
4. Belenguer JM, Benavent E, Lacomme P and Prins C (2006). Lower and upper bounds for the mixed capacitated arc routing problem. Comput Opns Res 33: 3363-3383.
5. Benavent E, Campos V, Corbeŕan A and Mota E (1990). The capacitated arc routing problem: Lower Bounds. Networks 22: 669-690.
6. Christofides N, Campos V, Corbeŕan A and Mota E (1986). An algorithm for the rural postman problem on a directed graph. Math Program Stud 26: 155-166.
7. Dror M (2000). Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers: Boston.
8. Eglese R and Letchford A (2000). Polyhedral theory for arc routing problems. In: Dror M (ed). Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers: Boston, pp 199-226.
9. Golden BL and Wong RT (1981). Capacitated arc routing problems. Networks 11: 305-315.
10. Gross J and Yellen J (eds) (2004). Handbook of Graph Theory. Discrete Mathematics and its Applications. CRC Press: London
11. Hertz A (2005). Recent trends in arc routing. In: Golumbic MC and Ben-Arroyo Hartman I (eds). Graph Theory, Combinatorics and Algorithmics: Interdisciplinary Applications. Springer: Berlin, pp 215-236.
12. Hertz A and Mittaz M (2000). Heuristics algorithms. In: Dror M (ed). Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers: Boston, pp 327-386.
13. Hirabayashi R, Saruwatari Y and Nishida N (1992). Tour construction algorithm for the capacitated arc routing problems. Asia Pac J Opns Res 9: 155-175.
14. Marzolf F, Tŕepanier M and Langevin A (2006). Road network monitoring: Algorithms and a case study. Comput Opns Res 33: 3494-3507.
15. Perrier N, Langevin A and Amaya A (2008). Vehicle routing for urban snow plowing operations. Transport Sci 42(1): 44-56.
16. Sniezek J, Bodin L, Levy L and Ball M (2002). Capacitated arc routing problem with vehicle-site dependencies: The Philadelphia experience. In: Toth P and Vigo D (eds). The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications. SIAM: Philadelphia, pp 287-330.
17. Ulusoy G (1985). The fleet size and mix problem for capacitated arc routing. Eur J Opl Res 22: 329-337.
18. Wøhlk S (2006). New lower bound for the capacitated arc routing problem. Comput Opns Res 33: 3458-3472.