A hybrid genetic algorithm for the multiple depot capacitated arc routing problem

Proceedings of the IEEE International Conference on Automation and Logistics, ICAL 2007

Volumn , Issue , 2007, Pages 2253-2258

  Zhu, Zhengyu ^a   Li, Xiaohua ^a   Yang, Yong ^a   Deng, Xin ^a   Xia, Mengshuang ^a   Xie, Zhihua ^a   Liu, Jianhui ^a  

^a CHONGQING UNIVERSITY   (China)

Author keywords

Algorithm; Hybrid genetic; MDCARP; Multiple depot capacitated arc routing problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; PROBLEM SOLVING;

METAHEURISTICS; MULTIPLE DEPOT CAPACITATED ARC ROUTING PROBLEMS;

VEHICLE ROUTING;

EID: 40649084116     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICAL.2007.4338951     Document Type: Conference Paper

References (11)

1. B.L. Golden, R.T. Wong, Capacitated arc routing problems. Networks 11(1981), pp. 305-315.
2. Hirabayashi R, Saruwatari Y, Nishida N. Tour construction algorithm for the capacitated arc routing problem. Asia-Pacific Journal of Operational Research. 1992;9:155-75.
3. Golden BL, Dearmon JS, Baker EK. Computational experiments with algorithms for a class of routing problems. Computers and Operations Research 1983;10(1):47-59.
4. Ulusoy G. The fleet size and mix problem for capacitated arc routing. European Journal of Operational Research 1985;22:329-37.
5. Eglese RW, Li LYO. A tabu search based heuristic for arc routing with a capacity constraint and time deadline. In: Osman IH, Kelly JP, editors. Metaheuristics: theory and applications. Kluwer; 1996. p. 633-50.
6. Hertz A, Laporte G, Mittaz M. A tabu search heuristic for the Capacitated Arc Routing Problem. Operations Research 2000:48(1): 129-35.
7. Lacomine 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.
8. 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. Annals of Operations Research 2004; 131:159-85.
9. Greistorfer P. A tabu scatter search metaheuristic for the arc routing problem. Computers and Industrial Engineering 2003;44:249-66.
10. Beullens P, Muyldermans L, Cattrysse D, Van Oudheusden D. A guided local search heuristic for the capacitated arc routing problem. European Journal of Operational Research 2003;147(3):629-43.
11. J.M. Belenguer, E. Benavent, A cutting plane algorithm for the capacitated arc routing problem. Research Report, Dept. of Statistics and OR, Univ. of Valencia (Spain), 1997.