A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem

Computers and Operations Research

Volumn 37, Issue 12, 2010, Pages 2089-2105

  Zachariadis, Emmanouil E ^a   Kiranoudis, Chris T ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

Combinatorial optimization; Computational complexity; Local search; Vehicle routing

Indexed keywords

ALGORITHMIC ASPECTS; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPLEXITY REDUCTION; DESCRIPTORS; GEOGRAPHIC DISTRIBUTION; LARGE SIZES; LOCAL SEARCH; LOCAL SEARCH IMPLEMENTATION; LOCAL SEARCH METHOD; LOCAL SEARCH OPERATORS; MAJOR CITIES; METAHEURISTIC; METAHEURISTIC STRATEGY; NEW SOLUTIONS; REAL-WORLD; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL METHODS; DATA STRUCTURES; HEURISTIC METHODS; MATHEMATICAL OPERATORS; ROUTING ALGORITHMS; VEHICLES;

COMPUTATIONAL COMPLEXITY;

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

References (34)

1. E.H. Aarts, and J.K. Lenstra Local search in combinatorial optimization 1997 Wiley Chichester, UK
2. F. Glover Tabu searchPart I ORSA Journal on Computing 1 1989 190 206
3. C. Voudouris, and E. Tsang Guided local search European Journal of Operational Research 113 1998 80 119
4. P. Hansen, and N. Mladenović Variable neighborhood search: principles and applications European Journal of Operational Research 130 2001 449 467 (Pubitemid 32875304)
5. F. Li, B. Golden, and E. Wasil Very large-scale vehicle routing: new test problems, algorithms, and results Computers and Operations Research 32 1989 1165 1179
6. G.A.P. Kindervater, and M.W.P. Savelsbergh Vehicle routing: handling edge exchanges E.H. Aarts, J.K. Lenstra, Local search in combinatorial optimization 1997 Wiley Chichester, UK 337 360
7. P. Toth, and D. Vigo The granular tabu search (and its application to the vehicle routing problem) INFORMS Journal on Computing 15 2003 333 348
8. D. Vigo A heuristic algorithm for the asymmetric capacitated vehicle routing problem European Journal of Operational Research 89 1996 108 126
9. F. Glover, and M. Laguna Tabu search 1997 Kluwer Boston, MA
10. S. Coy, B. Golden, G. Runger, and E. Wasil See the forest before the trees: fine-tuned learning and its application to the traveling salesman problem IEEE Transactions on Systems, Man and Cybernetics 28 1998 454 464
11. Nagata Y, Brysy O, Efficient local search limitation strategies for vehicle routing problems. In: Cotta C, van Hemert J, editors. EvoCOP 2008, Lecture Notes in Computer Science, vol. 4972, 2008, Springer-Verlag, Berlin, Heidelberg, p. 4860.
12. S. Lin, and B. Kernighan An effective heuristic algorithm for the traveling-salesman problem Operations Research 21 1973 498 516
13. N. Christofides, and S. Eilon Algorithms for large-scale travelling salesman problems Operational Research Quarterly 23 1972 511 518
14. S. Irnich, B. Funke, and T. Grnert Sequential search and its application to vehicle-routing problems Computers and Operations Research 33 2006 2405 2429
15. S. Irnich Unified Modeling and solution framework for vehicle routing and local search-based metaheuristics INFORMS Journal on Computing 20 2008 270 287
16. F. Glover Ejection chains, reference structures and alternating path methods for traveling salesman problems Discrete Applied Mathematics 65 1996 223 253
17. C. Rego A subpath ejection method for the vehicle routing problem Management Science 44 1998 1447 1459
18. C. Rego Node ejection chains for the vehicle routing problem: sequential and parallel algorithms Parallel Computing 27 2001 201 222
19. I. Osman Metastrategy simulated annealing and TABU search algorithms for the vehicle routing problem Annals of Operations Research 41 1993 421 451
20. M. Gendreau, A. Hertz, and G. Laporte A tabu search heuristic for the vehicle routing problem Management Science 40 1994 1276 1290
21. J. Xu, and J. Kelly A network flow-based tabu search heuristic for the vehicle routing problem Transportation Science 30 1996 379 393
22. Y. Rochat, and E.D. Taillard Probabilistic diversification and intensification in local search for vehicle routing Journal of Heuristics 1 1995 147 167
23. C.D. Tarantilis, and C.T. Kiranoudis BoneRoute: an effective memory-based method for effective fleet management Annals of Operations Research 115 2002 227 241
24. C.D. Tarantilis Solving the vehicle routing problem with adaptive memory programming methodology Computers and Operations Research 32 2005 2309 2327
25. B. Golden, E. Wasil, J. Kelly, and I. Chao The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results T. Crainic, G. Laporte, Fleet management and logistics 1998 Kluwer Boston, MA 33 56
26. Or I. Traveling salesman-type combinatorial optimization problems and their relation to the logistics of regional blood banking. Ph.D. thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL, USA, 1976.
27. M. Reimann, K. Doerner, and R. Hartl D-ants: savings based ants divide and conquer the vehicle routing problem Computers and Operations Research 31 2004 563 591
28. D. Mester, and O. Brysy Active-guided evolution strategies for large-scale capacitated vehicle routing problems Computers and Operations Research 34 2007 2964 2975 (Pubitemid 46356733)
29. C.D. Tarantilis, E.E. Zachariadis, and C.T. Kiranoudis A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities INFORMS Journal on Computing 20 2008 154 168
30. M. Fredman, and R. Tarjan Fibonacci heaps and their uses in improved network optimization algorithms Journal of the ACM 34 1987 596 615
31. H. Paessens The savings algorithm for the vehicle routing problem European Journal of Operational Research 34 1988 336 344
32. D. Pisinger, and S. Rpke A general heuristic for vehicle routing problems Computers and Operations Research 34 2007 2403 2435
33. Nagata Y, Edge assembly crossover for the capacitated vehicle routing problem. In: Cotta C, van Hemert J, editors. EvoCOP 2007, Lecture Notes in Computer Science vol. 4446, 2007, Springer-Verlag, Berlin, Heidelberg, p., 14253.
34. J.R. Driscoll, H.N. Gabow, R. Shrairman, and R.E. Tarjan Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation Communications of the ACM 31 1988 1343 1354