A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs

Computers and Industrial Engineering

Volumn 59, Issue 4, 2010, Pages 954-963

  Tagmouti, Mariam ^a   Gendreau, Michel ^a,b   Potvin, Jean Yves ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

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

Author keywords

Capacitated arc routing; Time dependent service costs; Variable neighborhood descent

Indexed keywords

ALTERNATIVE APPROACH; ARC ROUTING; ARC ROUTING PROBLEMS; CAPACITATED ARC ROUTING PROBLEM; COMPUTATIONAL RESULTS; NEIGHBORHOOD STRUCTURE; ROUTING PROBLEMS; SERVICE COSTS; TIME-DEPENDENT; VARIABLE NEIGHBORHOOD DESCENT;

COSTS;

EID: 78049403831     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2010.09.006     Document Type: Article

References (33)

1. A. Amberg, W. Domschke, and S. Voss Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees European Journal of Operational Research 2000 360 376
2. L.D. Bodin, and S.J. Kursh A computer-assisted system for the routing and scheduling of street sweepers Operations Research 26 1987 525 537
3. J. Brandão, and R.W. Eglese A deterministic tabu search algorithm for the capacitated arc routing problem Computers & Operations Research 35 2008 1112 1126
4. D. Cattrysse, T. Lotan, L. Muyldermans, and D.V. Oudheusden Districting for salt spreading operations European Journal of Operational Research 139 2002 521 532
5. L. Chapleau, J.A. Ferland, G. Lapalme, and J.-M. Rousseau A parallel insert method for the capacitated arc routing problem Operations Research Letters 3 1984 95 99
6. N. Christofides The optimum traversal of a graph, OMEGA The International Journal of Management Science 1 1973 719 732
7. G. Clarke, and J. Wright Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 1964 568 581
8. Doerner, K. F., Hartl, R. F., Maniezzo, V., & Reimann, M. (2003). An ant system metaheuristic for the capacitated arc routing problem. In Proceedings of the 5th metaheuristics international conference, Tokyo, Japan.
9. R.W. Eglese Simulated annealing: A tool for operational research European Journal of Operational Research 46 1990 271 281
10. R.W. Eglese Routeing winter gritting vehicles Discrete Applied Mathematics 48 1994 231 244
11. Fleury, G., Lacomme, P., & Prins, C. (2004). Evolutionary algorithms for stochastic arc routing problems. In Evo workshop 2004. Lecture notes in computer science (Vol. 3005, pp. 501-512).
12. D. Ghiani, G. Improta, and G. Laporte The capacitated arc routing problem with intermediate facilities Networks 37 2001 134 143
13. B.L. Golden, J.S. DeArmon, and E.K. Baker Computational experiments with algorithms for a class of routing problems Computer & Operations Research 10 1983 47 59
14. B.L. Golden, and R.T. Wong Capacitated arc routing problems Networks 11 1981 305 315
15. P. Hansen, and N. Mladenović Variable neighborhood search methods C.A. Floudas, P.M. Pardalos, Encyclopedia of optimization 2009 Springer 3975 3989
16. A. Hertz, G. Laporte, and M. Mittaz A tabu search heuristic for the capacitated arc routing problem Operations Research 48 2000 129 135
17. A. Hertz, and M. Mittaz A variable neighborhood descent algorithm for the undirected capacitated arc routing problem Transportation Science 35 2001 425 434
18. T. Ibaraki, S. Imahori, M. Kudo, T. Masuda, T. Uno, and M. Yagiura Effective local search algorithms for routing and scheduling problems with general time-window constraints Transportation Science 39 2005 206 232
19. N. Labadi, C. Prins, and M. Reghioui GRASP with path relinking for the capacitated arc routing problem with time windows A. Fink, F. Rothlauf, Advances in computational intelligence in transport, logistics and supply chain management. Studies in computational intelligence Vol. 144 2008 Springer 111 135
20. Lacomme, P., Prins, C., & Ramdane-Chérif, W. (2002). Evolutionary algorithms for multiperiod arc routing problems. In Proceedings of the ninth conference on information processing and management of uncertainty in knowledge based systems, Annecy, France (pp. 845-852).
21. P. Lacomme, C. Prins, and W. Ramdane-Chérif Competitive memetic algorithms for arc routing problems Annals of Operations Research 131 2004 159 185 (Pubitemid 39187378)
22. A.N. Letchford, and R.W. Eglese The rural postman problem with deadline classes European Journal of Operational Research 105 1998 390 400
23. Li, L. Y. O. (1992). Vehicle routeing for winter gritting. Ph.D. Thesis, Dept. of Management Science, Lancaster University, UK.
24. L.Y.O. Li, and R.W. Eglese An iterative algorithm for vehicle routeing for winter-gritting Journal of the Operational Research Society 47 1996 217 228
25. K. Mei-Ko Graphic programming using odd and even points Chinese Mathematics 1 1962 273 277
26. N. Mladenović, and P. Hansen Variable neighborhood search Computers & Operations Research 34 1997 1097 1100
27. Or, I. (1976). Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. PhD Thesis, Dept. of Industrial Engineering and Management Sciences, Northwestern University, USA.
28. W.L. Pearn Approximate solutions for the capacitated arc routing problem Computers & Operations Research 16 1989 589 600
29. W.L. Pearn Augment-insert algorithms for the capacitated arc routing problem Computers & Operations Research 18 1991 189 198
30. J.-Y. Potvin, and J-M. Rousseau An exchange heuristic for routing problems with time windows Journal of the Operational Research Society 46 1995 1433 1446
31. M. Tagmouti, M. Gendreau, and J-Y. Potvin Arc routing problem with time-dependent service costs European Journal of Operational Research 181 2007 30 39
32. É. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J-Y. Potvin A tabu search heuristic for the vehicle routing problem with soft time windows Transportation Science 31 1997 170 186 (Pubitemid 127597092)
33. Wohlk, S. (2005). Contributions for arc routing. Ph.D. Thesis, Faculty of Social Sciences, University of Southern Denmark, Denmark.