Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem

Computers and Operations Research

Volumn 40, Issue 12, 2013, Pages 3197-3205

  Sörensen, Kenneth ^a   Schittekat, Patrick ^a  

^a UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

Capacitated vehicle routing problem; Edit distance; Grasp; Path relinking; Relocate distance; Statistical analysis

Indexed keywords

CAPACITATED VEHICLE ROUTING PROBLEM; EDIT DISTANCE; GRASP; PATH RELINKING; RELOCATE DISTANCE;

ROUTING ALGORITHMS; STATISTICAL METHODS;

NETWORK ROUTING;

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

References (24)

1. L. Alfandari, A. Plateau, and P. Tolla A path relinking algorithm for the generalized assignment problem M.G.C. Resende, J.P. De Sousa, Metaheuristics computer decision-making 2004 Kluwer Boston 1 18
2. Augerat P, Belenguer JM, Benavent E, Corberán A, Naddef D, Rinaldi G. Computational results with a branch and cut code for the capacitated vehicle routing problem. In: Rapport de recherche-IMAG, 1995. ISSN 0750-7380.
3. R. Baldacci, P. Toth, and D. Vigo Exact algorithms for routing problems under vehicle capacity constraints Annals of Operations Research 175 1 2010 213 245
4. G. Clarke, and J.W. Wright Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 4 1964 568 581
5. A. El Fallahi, C. Prins, and R. Wolfler Calvo A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem Computers & Operations Research 35 5 2008 1725 1741 (Pubitemid 47488641)
6. T.J. Gaskell Bases for vehicle fleet scheduling Operations Research 18 3 1967 281 295
7. F. Glover Scatter search and path relinking D. Corne, M. Dorigo, F. Glover, New ideas in optimization 1999 McGraw-Hill
8. F. Glover, and M. Laguna Fundamentals of scatter search and path relinking Control and Cybernetics 29 3 2000 653 684
9. H. Hashimoto, and M. Yagiura A path relinking approach with an adaptive mechanism to control parameters for the vehicle routing problem with time windows J. Van Hemert, C. Cotta, Evolutionary computation in combinatorial optimization 2008 Springer 254 265
10. Ho Sin C, Gendreau Michel. Path relinking for the vehicle routing problem. In: Proceedings of nordic MPS 2004. The ninth meeting of the nordic section of the mathematical programming society, Norrköping, Sweden, 2004.
11. V.I. Levenshtein Binary codes capable of correcting deletions, insertions, and reversals Soviet Physics - Doklady 10 1966 707 710
12. D. Mester, and O. Bräysy Active-guided evolution strategies for large-scale capacitated vehicle routing problems Computers & Operations Research 34 2007 2964 2975 (Pubitemid 46356733)
13. N. Mladenović, and P. Hansen Variable neighborhood search Computers & Operations Research 24 11 1997 1097 1100
14. Y. Nagata, and O. Bräysy Edge assembly-based memetic algorithm for the capacitated vehicle routing problem Networks 54 2009 205 215
15. Oliveira CAS, Pardalos PM, Resende MGC. GRASP with path-relinking for the quadratic assignment problem. Experimental and efficient algorithms. Springer; 2004. p. 356-68.
16. Reghioui M, Prins C, Labadi N. GRASP with path relinking for the capacitated arc routing problem with time windows. Applications of evolutionary computing. Springer; 2007. p. 722-31. (Pubitemid 47290130)
17. Resende MGC, Ribeiro CC. GRASP and path relinking: recent advances and applications. Technical Report. AT&T Labs Research; 6 April 2003.
18. Resende MGC, Werneck RF. A hybrid multistart heuristic for the uncapacitated facility location problem. Technical Report TD-5RELRR. AT&T Labs Research; 2003.
19. Y. Rochat, and É.D. Taillard Probabilistic diversification and intensification in local search for vehicle routing Journal of Heuristics 1 1 1995 147 167
20. Sörensen K, Reimann M, Prins C. Permutation distance measures for memetic algorithms with population management. In: Proceedings of MIC'2005, the sixth metaheuristics international conference, Vienna, Austria, 2005.
21. Souffriau W, Vansteenwegen P, Vanden Berghe G, Van Oudheusden D. A path relinking approach for the team orienteering problem. Computers & Operations Research 2010;37:1853-59.
22. W.Y. Szeto, Y. Wu, and S.C. Ho An artificial bee colony algorithm for the capacitated vehicle routing problem European Journal of Operational Research 215 1 2011 126 135
23. R.A. Wagner, and M.J. Fischer The string-to-string correction problem Journal of the ACM 21 1974 168 173
24. P.C. Yellow A computational modification to the savings method of vehicle scheduling Operational Research Quarterly 21 2 1970 281 283