A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows

Networks

Volumn 54, Issue 4, 2009, Pages 190-204

  Prescott Gagnon, Eric ^a   Desaulniers, Guy ^a   Rousseau, Louis Martin ^a  

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

Author keywords

Heuristic column generation; Large neighborhood search; Time windows; Vehicle routing

Indexed keywords

BRANCH AND PRICE; COLUMN GENERATION; COMPUTATIONAL RESULTS; EXACT SOLUTION; HEURISTIC APPROACH; LARGE NEIGHBORHOOD SEARCH; NUMBER OF VEHICLES; SET OF CUSTOMERS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

HEURISTIC METHODS; LEARNING ALGORITHMS; ROUTING ALGORITHMS; VEHICLE ROUTING; VEHICLES; WINDOWS;

FLEET OPERATIONS;

EID: 71649099891     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20332     Document Type: Article

References (30)

1. R. Bent and P. Van Hentenryck, A two-stage hybrid local search for the vehicle routing problem with time windows, Trans Sci 38 (2004), 515-530.
2. J. Berger, M. Barkaoui, and O. Bräysy, A route-directed hybrid genetic approach for the vehicle routing problem with time windows, INFOR 41 (2003), 179-194.
3. O. Bräysy, A reactive variable neighborhood search for the vehicle routing problem with time windows, INFORMS J Comput 15 (2003), 347-368. (Pubitemid 39042714)
4. O. Bräysy and M. Gendreau, Vehicle routing problem with time windows, Part I: Route construction and local search algorithms, Transp Sci 39 (2005), 104-118.
5. O. Bräysy and M. Gendreau, Vehicle routing problem with time windows, Part II: Metaheuristics, Transp Sci 39 (2005), 119-139.
6. A. Chabrier, Vehicle routing problem with elementary shortest path based column generation, Comput Oper Res 33 (2006), 2972-2990.
7. J.-F. Cordeau, G. Laporte, and A. Mercier, A unified tabu search heuristic for the vehicle routing problems with time windows, J Oper Res Soc 52 (2001), 928-936.
8. R. De Franceschi, M. Fischetti, and P. Toth, A new ILP-based refinement heuristic for vehicle routing problems, Math Program B 105 (2006), 471-499.
9. G. Desaulniers, J. Desrosiers, and M.M. Solomon, "Accelerating strategies for column generation methods in vehicle routing and crew scheduling problems," Essays and Surveys in Metaheuristics, C. C. Ribeiro and P. Hansen (Editors), Kluwer, Norwell, MA, 2002, pp. 309-324.
10. G. Desaulniers, F. Lessard, and A. Hadjar, Tabu search, generalized k-path inequalities, and partial elementarity for the vehicle routing problem with time windows, Les Cahiers du GERAD, G-2006-2045, HEC Montréal, Montréal, Canada, 2006.
11. M. Desrochers, J. Desrosiers, and M.M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Oper Res 40 (1992), 342-534.
12. M. Dror, Note on the complexity of the shortest path models for column generation in VRPTW, Oper Res 42 (1994), 977-978.
13. D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen, An exact algorithm for the elementary shortest path problem with resource constraints: Applicationto some vehicle routing problems, Networks 44 (2004), 216-229.
14. H. Gehring and J. Homberger, "A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows", Proceeding of EUROGEN99 - Short Course on Evolutionary Algorithms in Engineering and Computer Science, K. Miettinen, M. Makela, and J. Toivanen (Editors), University ofJyväskylä, Jyväskylä, Finland, 1999, pp. 57-64.
15. H. Gehring and J. Homberger, A parallel two-phase meta-heuristic for routing problems with time windows, Asia Pac J Oper Res 18 (2001), 35-47.
16. M. Gendreau, A. Hertz, G. Laporte, and M. Stan, A generalized insertion heuristic for the traveling salesman problem with time windows, Oper Res 46 (1995), 330-335.
17. F. Glover and M. Laguna, Tabu search, Kluwer, Norwell, MA, 1997.
18. J. Homberger and H. Gehring, A two-phase hybrid meta-heuristic for the vehicle routing problem with time windows, Eur J Oper Res 162 (2005), 220-238.
19. T. Ibaraki, S. Imahori, M. Kubo, T. Masuda, T. Uno, and M. Yagiura, Effective local search algorithms for routing and scheduling problems with general time window constraints, Transp Sci 39 (2005), 206-232.
20. T. Ibaraki, S. Imahori, K. Nonobe, K. Sobue, T. Uno, and M. Yagiura, An iterated local search algorithm for the vehicle routing problem with convex time penalty functions, Discrete Appl Math (2007).
21. S. Irnich and G. Desaulniers, "Shortest path problems with resource constraints," Column Generation, G. Desaulniers, J. Desrosiers, and M. M. Solomon (Editors), Springer, New-York, NY, 2005, pp. 33-65.
22. S. Irnich and D. Villeneuve, The shortest path problem with resource constraints and k-cycle elimination for k ≥ 3, INFORMS J Comput 18 (2006), 391-406.
23. M. Jepsen, B. Petersen, S. Spoorendonk, and D. Pisinger, A non-robust branch-and-cut-and-price algorithm for the vehicle routing problem with time windows. Technical Report 06-103, Department of Computer Science, University of Copenhagen, Denmark, 2006.
24. N. Kohl, J. Desrosiers, O.B.G. Madsen, M.M. Solomon, and F. Soumis, 2-path cuts for the vehicle routing problem with time windows, Transp Sci 33 (1999), 101-116.
25. A. Le Bouthillier, T.G. Crainic, and P. Kropf, A guided cooperative search for the vehicle routing problem with time windows, IEEE Intell Syst 20 (2005), 36-42.
26. D. Mester and O. Bräysy, Active guided evolution strategies for large scale vehicle routing problem with time windows, Comput Oper Res 32 (2005), 1592-1614.
27. D. Pisinger and S. Ropke, A general heuristic for vehicle routing problems, Comput Oper Res 34 (2007), 2403-2435.
28. L.-M. Rousseau, M. Gendreau, and G. Pesant, Using constraint-based operators to solve the vehicle routing problem with time windows, J Heuristics 8 (2002), 43-58.
29. P. Shaw, "Using constraint programming and local search methods to solve vehicle routing problems", Proceedings of Constraints Programming '98, M. Maher and J.F. Puget (Editors), Springer-Verlag, Berlin, 1998, pp. 417-431.
30. M.M. Solomon, Algorithms for the vehicle routing and scheduling problems with time window constraints, OperRes 35 (1987), 254-265.