A cooperative parallel meta-heuristic for the vehicle routing problem with time windows

Computers and Operations Research

Volumn 32, Issue 7, 2005, Pages 1685-1708

  Le Bouthillier, Alexandre ^a   Crainic, Teodor Gabriel ^a,b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

Cooperative search; Parallel meta heuristics; Solution warehouse strategy; Vehicle routing with time windows

Indexed keywords

ACCELERATION; COMPUTATIONAL METHODS; EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; QUALITY CONTROL;

COOPERATIVE SEARCH; PARALLEL META-HEURISTICS; SOLUTION WAREHOUSE STRATEGY; VEHICLE ROUTING WITH TIME WINDOWS;

PROBLEM SOLVING;

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

References (68)

1. Crainic TG. Parallel computation, co-operation, tabu search, In: Rego C, Alidaee B, editors. Adaptive memory and evolution: tabu search and scatter search. Norwell, MA: Kluwer Academic Publishers; 2002.
2. Crainic TG, Gendreau M. Towards an evolutionary method - cooperating multi-thread parallel tabu search hybrid. In: Voß S, Martello S, Roucairol C, Osman IH, editors. Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization. Norwell, MA: Kluwer Academic Publishers; 1998. p. 331-44.
3. Crainic TG, Gendreau M. Cooperative parallel tabu search for capacitated network design. Journal of Heuristics 2002;8(6):601-27.
4. Crainic TG, Toulouse M. Parallel metaheuristics. In: Crainic TG, Laporte G, editors. Fleet management and logistics. Norwell, MA: Kluwer Academic Publishers; 1998. p. 205-51.
5. Crainic TG, Toulouse M. Parallel strategies for meta-heuristics. In: Glover F, Kochenberger G, editors. State-of-the-art handbook in metaheuristics. Norwell, MA: Kluwer Academic Publishers; 2002. p. 475-513.
6. Crainic TG, Toulouse M, Gendreau M. Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements. Annals of Operations Research 1995;63:277-99.
7. Cung V-D, Martins SL, Ribeiro CC, Roucairol C. Strategies for the parallel implementations of metaheuristics. In: Ribeiro C, Hansen P, editors. Essays and surveys in metaheuristics. Norwell, MA: Kluwer Academic Publishers; 2001. p. 263-308.
8. Garcia BL, Potvin J-Y, Rousseau JM. A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints. Computers & Operations Research 1994;21(9):1025-33.
9. Gambardella L, Taillard ÉD, Agazzi G. MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. Technical report IDSIA-9-99, IDSIA, Lugano, Switzerland, 1999.
10. Hornberger J, Gehring H. Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR 1999;37:297-318.
11. Gehring H, Homberger J. A parallel two-phase metaheuristic for routing problems with time windows. Asia-Pacific Journal of Operational Research 2001;18(1):35-47.
12. Schulze J, Fahle T. A parallel algorithm for the vehicle routing problem with time window constraints. Annals of Operations Research 1999;86:585-607.
13. Taillard ÉD, Gambardella LM, Gendreau M, Potvin J-Y. Programmation à mémoire adaptative. Calculateurs Parallèles, Réseaux et Systèmes répar tis 1998;10:117-40.
14. Taillard ÉD. Recherches itératives dirigées parallèles. Ph.D. thesis, École Polytechnique Fédérale de Lausanne, 1993.
15. Toulouse M, Crainic TG, Sansó B, Thulasiraman K. Self-organization in cooperative search algorithms. In: Proceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics, Madisson, Wisconsin: Omnipress; 1998. p. 2379-85.
16. Cordeau J-F, Desaulniers G, Desrosiers J, Solomon MM, Soumis F. The VRP with time windows. In: Toth P, Vigo D. editors. The vehicle routing problem, SIAM, Monographs on Discrete Mathematics and Applications, Philadelphia, PA: SIAM; 2002a. p. 157-93, [chapter 7].
17. Bráysy O, Gendreau M. Tabu search heuristics for the vehicle routing problem with time windows. Top 2002;10(2):211-38. (see http://top.umh.es/issue10-2.html)
18. Cordeau J-F, Gendreau M, Laporte G, Potvin J-Y, Semet F. A guide to vehicle routing heuristics, Journal of the Operational Research Society 2002b;53:512-22.
19. Christofides N, Mingozzi A, Toth P. The vehicle routing problem. In: Christofides NAM, Toth P, Sandi C, editors. Combinatorial Optimization. New York: Wiley; 1979. p, 315-38.
20. Desrosiers J, Dumas Y, Solomon MM, Soumis F. Time constrained routing and scheduling. In: Ball M, Magnanti TL, Monma CL, Nemhauser GL, editors. Network routing. Handbooks in operations research and management science, vol. 8. Amsterdam: North-Holland; 1995. p. 35-139.
21. Desaulniers G, Desrosiers J, loachim I, Solomon MM, Soumis F, Villeneuve D. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. In: Crainic TG, Laporte G, editors. Fleet management and logistics. Norwell, MA: Kluwer Academic Publishers; 1998. p. 57-93.
22. Fisher ML. Vehicle routing. In: Ball M, Magnanti TL, Monma CL, Nemhauser GL, editors. Network routing. Handbooks in operations research and management science, vol. 8. Amsterdam: North-Holland; 1995. p. 1-33.
23. Gendreau M, Laporte G, Potvin J-Y. Metaheuristics for the vehicle routing problem. In: Toth P, Vigo D, editors. The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, vol, 9. Philadelphia, PA: SIAM; 2002. p. 129-54.
24. Golden BL, Assad AA, editors. Vehicle routing: methods and studies. Amsterdam: North-Holland; 1988.
25. Golden BL, Wasil EA, Kelly JP, Chao IM. Metaheuristics in vehicle routing. In: Crainic T, Laporte G, editors. Fleet management and logistics. Boston, MA: Kluwer Academic Publishers; 1998. p. 33-56.
26. Laporte G. The vehicle routing problem: an overview of exact and approximate algorithms. European Journal of Operational Research 1992;59:345-58.
27. Laporte G, Semet F. Classical heuristics for the vehicle routing problem. In: Toth P, Vigo D, editors. The vehicle routing problem, SIAM Monographs on Discrete Mathematics and Applications, vol. 9. Philadelphia, PA: SIAM; 2002. p. 109-28.
28. Laporte G, Gendreau M, Potvin J-Y, Semet F. Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research 2000;7(4/5):285-300.
29. Toth P, Vigo D. Exact solution of the vehicle routing problem. In: Crainic TG, Laporte G, editors. Fleet management and logistics. Norwell, MA: Kluwer Academic Publishers; 1998. p. 1-31.
30. Toth P, Vigo D, editors. The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, vol. 9. Philadelphia, PA: SIAM; 2002.
31. Aiex RM, Martins SL, Ribeiro CC, Rodriguez NR. Cooperative multi-thread parallel tabu search with an application to circuit partitioning. In: Proceedings of IRREGULAR'98 - Fifth International Symposium on Solving Irregularly Structured Problems in Parallel, Lecture Notes in Computer Science, vol. 1457. Berlin: Springer; 1998. p. 310-31.
32. Solomon MM. Time window constrained routing and scheduling problems. Operations Research 1987;35:254-65.
33. Chabrier A. Vehicle routing problem with elementary shortest path based column generation. Working paper, ILOG, Madrid: Spain; 2002.
34. Cook W, Rich JL. A parallel cutting plane algorithm for the vehicle routing problem with time windows. Working paper, Computational and Applied Mathematics, Rice University, Houston, TX, 1999.
35. Kallehauge B, Larsen J, Madsen OBG. Lagrangean duality and non-differentiable optimization applied on routing with time windows - experimental results. Internal report imm-rep-2000-8, Department of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark, 2000.
36. Larsen J. Parellellization of the vehicle routing problem with time windows. Ph.D. thesis, Department of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark, 1999.
37. Kohl N, Desrosiers J, Madsen OBG, Solomon MM, Soumis F. 2-path cuts for the vehicle routing problem with time windows. Transportation Science 1999;33(1):101-16.
38. Glover F. Tabu search - Part I. ORSA Journal on Computing 1989; 1(3): 190-206.
39. Glover F. Tabu search - Part II. ORSA Journal on Computing 1990;2(1):4-32.
40. Glover F, Laguna M. Tabu search. Norwell, MA: Kluwer Academic Publishers; 1997.
41. Gendreau M, Hertz A, Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 1994;40:1276-90.
42. Cordeau J-F, Laporte G, Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society 2001;52:928-36.
43. Rousseau L-M, Gendreau M, Pesant G. Using constraint-based operators with variable neighborhood search to solve the vehicle routing problem with time windows. Journal of Heuristics 2002;8(1):43-58.
44. Mladenović N, Hansen P. Variable neighborhood search. Computers & Operations Research 1997;24:1097-100.
45. Hansen P, Mladenović N. An introduction to variable neighborhood search. In: Voß S, Martello S, Roucairol C, Osman IH, editors. Meta-heuristics 98: theory and applications. Norwell, MA: Kluwer Academic Publishers; 1999. p. 433-58.
46. Hansen P, Mladenović N. Developments of variable neighborhood search. In: Ribeiro C, Hansen P, editors. Essays and surveys in metaheuristics. Norwell, MA: Kluwer Academic Publishers; 2002. p. 415-39.
47. Bräysy O. A reactive variable neighborhood search algorithm for the vehicle routing problem with time windows. INFORMS Journal on Computing, 2003;15(4):347-68.
48. Bräysy O, Hasle G, Dullaert W. A multi-start local search algorithm for the vehicle routing problem with time windows. European Journal of Operational Research, In Press, corrected proof available online 8th October 2003.
49. Taillard ÉD, Badeau P, Gendreau M, Guertin F, Potvin J-Y. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 1997;31(2):170-86.
50. Bräysy O, Dullaert W. A fast evolutionary metaheuristic for the vehicle routing problem with time windows. International Journal on Artificial Intelligence 2003;12(2):153-72.
51. Bent R, Van Hentenryck P. A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science, to appear.
52. Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. Lecture Notes in Computer Science 1998; 1520:417-31.
53. Rochat Y, Taillard ÉD. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1995;1(1): 147-67.
54. Badeau P, Guertin F, Gendreau M, Potvin J-Y, Taillard ÉD. A parallel tabu search heuristic for the vehicle routing problem with time windows. Transportation Research C: Emerging Technologies 1997;5(2): 109-22.
55. Hornberger J. Verteilt-parallele metaheuristiken zur tourenplanung. Technical report, Gaber, Wiesbaden, 2000.
56. Berger J, Barkaoui M, Bräysy O. A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Working paper, Defense Research Establishment Valcartier, Canada, 2001.
57. Toulouse M, Crainic TG, Gendreau M. Communication issues in designing cooperative multi thread parallel searches. In: Osman IH, Kelly JP, editors. Meta-heuristics: theory & applications. Norwell, MA: Kluwer Academic Publishers; 1996. p. 501-22.
58. Gendreau M, Hertz A, Laporte G. New insertion and postoptimization procedures for the traveling salesman problem. Operations Research 1992;40(6): 1086-94.
59. Gendreau M, Hertz A, Laporte G, Stan M. A generalized insertion heuristic for the traveling salesman problem with time windows. Operations Research 1998;46(3):330-5.
60. Glover F. Multilevel tabu search and embedded search neighborhoods for the traveling salesman problem. Working paper, College of Business & Administration, University of Colorado, USA, 1991.
61. Glover F. Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics 1992;49:231-55.
62. Rego C. A subpath ejection method for the vehicle routing problem. Management Science 1998;44:1447-59.
63. Rego C. Node ejection chains for the vehicle routing problem: sequential and parallel algorithms. Parallel Computing 2001;27:201-22.
64. Caseau Y, Laburthe F. Heuristics for large constrained vehicle routing problems. Journal of Heuristics 1999;5: 281-303.
65. Kindervater G, Savelsbergh M. Vehicle routing: handling edge exchanges. In: Aarts E, Lenstra JK, editors. Local search in combinatorial optimization, New York: Wiley; 1997. p. 337-60, [chapter 10].
66. De Backer B, Furnon V, Shaw P, Kilby P, Prosser P. Solving vehicle routing problems using constraint programming and metaheuristics. Journal of Heuristics 2000;6:501-23.
67. Bentley J. Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing 1992;4(4): 388-411.
68. Le Bouthillier A, Crainic TG. Cooperative parallel method for vehicle routing problems with time windows. Publication CRT-00-55, Centre de recherche sur les transports, Université de Montréal, Montréal, QC, Canada, 2002.