Sequential search and its application to vehicle-routing problems

Computers and Operations Research

Volumn 33, Issue 8, 2006, Pages 2405-2429

  Irnich, Stefan ^a   Funke, Birger ^b   Grünert, Tore ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b GTS Systems and Consulting GmbH   (Germany)

Author keywords

Local search; Vehicle routing problem

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; DATA COMMUNICATION EQUIPMENT; OPTIMIZATION; PROBLEM SOLVING;

LOCAL SEARCH; SYSTEMATIC DECOMPOSITION; VEHICLE-ROUTING PROBLEM;

HEURISTIC METHODS;

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

References (43)

1. N. Christofides, and S. Eilon Algorithms for large-scale travelling salesman problems Operational Research Quarterly 23 4 1972 511 518
2. S. Lin, and B. Kernighan An effective heuristic algorithm for the traveling-salesman problem Operations Research 21 1973 498 516
3. B. Kernighan, and S. Lin An efficient heuristic procedure for partitioning graphs Bell Systems Technology Journal 49 1970 291 307
4. C. Li, D. Simchi-Levi, and M. Desrochers On the distance constrained vehicle routing problem Operations Research 40 4 1992 790 799
5. P. Toth, and D. Vigo Exact solution of the vehicle routing problem T. Crainic G. Laporte Fleet management and logistics 1998 Kluwer Academic Publishers Norwell, MA and Dordrecht, The Netherlands 1 32 [Chapter 1]
6. G. Dantzig, and J. Ramser The truck dispatching problem Management Science 6 1959 80 91
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. G. Laporte, and F. Semet Classical heuristics for the capacitated VRP P. Toth D. Vigo The vehicle routing problem, SIAM Monographs on Discrete Mathematics and Applications 2002 Society for Industrial and Applied Mathematics Philadelphia 109 128 [Chapter 5]
9. É. Taillard Parallel iterative search methods for vehicle routing problems Networks 23 1993 661 676
10. I. Osman Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem Annals of Operations Research 41 1993 421 451
11. M. Gendreau, A. Hertz, and G. Laporte A tabu search heuristic for the vehicle routing problem Management Science 40 10 1994 1276 1290
12. Y. Rochat, and É. Taillard Probabilistic diversification and intensification in local search for vehicle routing Journal of Heuristics 1 1995 147 167
13. J. Cordeau, G. Laporte, and A. Mercier A unified tabu search heuristic for vehicle routing problems with time windows Journal of the Operational Research Society 52 2001 928 936
14. J. Cordeau, M. Gendreau, G. Laporte, J. Potvin, and F. Semet A guide to vehicle routing heuristics Journal of the Operational Research Society 53 2002 512 522
15. P. Toth, and D. Vigo The granular tabu search and its application to the vehicle-routing problem INFORMS Journal on Computing 15 4 2003 333 346
16. M. Gendreau, G. Laporte, and J. Potvin Metaheuristics for the capacitated VRP P. Toth D. Vigo The vehicle routing problem, SIAM Monographs on Discrete Mathematics and Applications 2002 Society for Industrial and Applied Mathematics Philadelphia 129 154 [Chapter 6]
17. P. Toth, and D. Vigo Branch-and-bound algorithms for the capacitated VRP P. Toth D. Vigo The vehicle routing problem, SIAM Monographs on Discrete Mathematics and Applications 2002 Society for Industrial and Applied Mathematics Philadelphia 29 51 [Chapter 2]
18. Toth P. Vigo D, editors. The vehicle routing problem, SIAM Monographs on Discrete Mathematics and Applications. Philadelphia: Society for Industrial and Applied Mathematics; 2002b.
19. D. Naddef, and G. Rinaldi Branch-and-Cut algorithms for the capacitated VRP P. Toth D. Vigo The vehicle routing problem, SIAM monographs on discrete mathematics and applications 2002 Society for Industrial and Applied Mathematics Philadelphia 53 84 [Chapter 3]
20. Fukasawa R, Marcus Poggi de Aragão MR, Uchoa E. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Relatórios de Pesquisa em Engenharia de Produção, vol. 3, no. 8, Departamento de Engenharia de Produção, Universidade Federal Fluminense R. Passo da Pátria, 156, Bloco E, sala 440, Niterói, Brasil, 24210-240, 2003.
21. E. Aarts, and J. Lenstra Local search in combinatorial optimization 1997 Wiley Chichester
22. V. Rayward-Smith, I. Osman, C. Reeves, and G. Smith Modern heuristic search methods 1996 Wiley Chichester
23. Glover F. Ejection chains, reference structures and alternating path methods for traveling salesman problems. Technical report, US West Chair in Systems Science, University of Colorado, Boulder, School of Business, Campus Box 419, Boulder, CO 80309, 1992.
24. G. Kindervater, and M. Savelsbergh Vehicle routing: handling edge exchanges E. Aarts J. Lenstra Local search in combinatorial optimization 1997 Wiley Chichester 337 360 [Chapter 10]
25. M. Bellmore, and S. Hong Transformation of multisalesmen problem to the standard traveling salesman problem Journal of the Association for Computing Machinery 21 3 1974 500 504
26. M. Rao A note on multiple traveling salesman problem Operations Research 28 3 Part I 1980 628 632
27. G. Croes A method for solving traveling-salesman problems Operations Research 6 1958 791 812
28. J. Potvin, G. Lapalme, and J. Rousseau A generalized k -opt exchange procedure for the MTSP Information Systems and Operations Research 27 4 1989 474 481
29. Funke B, Grünert T, Irnich S. A note on single alternating cycle neighborhoods for the TSP, Journal of Heuristics, 2004, to appear.
30. J. Bentley Fast algorithms for geometric traveling salesman problems Operations Research Society of America 4 4 1992 387 411
31. D. Johnson, and L. McGeoch The traveling salesman problem: a case study in local optimization E. Aarts J. Lenstra Local search in combinatorial optimization 1997 Wiley Chichester 215 310 [Chapter 8]
32. Or I. Traveling salesman-type 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, 1976.
33. Funke B, Grünert T, Irnich S. Local search for vehicle routing and scheduling problems: review and conceptual integration. Technical report, Lehr- und Forschungsgebiet Operations Research und Logistik Management, RWTH Aachen, Templergraben 64, 52056 Aachen, 2003.
34. G. Reinelt TSPLIB - A traveling salesman problem library ORSA Journal on Computing 3 4 1991 376 384
35. H. Paessens The savings algorithm for the vehicle routing problem European Journal of Operational Research 34 1988 336 344
36. N. Mladenović, and P. Hansen Variable neighborhood search Computers & Operations Research 24 1997 1097 1100
37. P. Hansen, and N. Mladenović Variable neighborhood search: principles and applications European Journal of Operational Research 130 1 2001 449 467
38. P. Hansen, and N. Mladenović Developments of variable neighborhood search C. Ribeiro P. Hansen Essays and surveys in metaheuristics, Operations Research/Computer Science Interfaces Series 2002 Kluwer Boston 415 439 [Chapter 19]
39. Irnich S, Funke B, Grünert T. Efficient local search for cvrp, move decomposition and sequential search. Extended Abstract, TRISTAN V, Fifth triennial symposium on transportation analysis, Guadeloupe, France, 2004.
40. Hansen P, Mladenović N. First vs. best improvement: an empirical study. Technical Report Les Cahiers du GERAD G-99-40, École des Hautes Études Commerciales, Montréal, Canada, 1999. Revised: January 2004.
41. F. Glover, and M. Laguna Tabu search 1997 Kluwer Dortrecht
42. Festa P, Resende G. An annoted bibliography of GRASP. Technical report TD-5WYSEW, AT&T Labs Research, 2004.
43. O. Martin, S. Otto, and E. Felten Large-step Markov chains for the TSP incorporating local search heuristics Operations Research Letters 11 4 1992 219 224