Spatial, temporal, and hybrid decompositions for large-scale vehicle routing with time windows

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6308 LNCS, Issue , 2010, Pages 99-113

  Bent, Russell ^a   Van Hentenryck, Pascal ^b  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; ITERATIVE METHODS; OPTIMIZATION; SALES; VEHICLE ROUTING;

ADAPTIVE DECOMPOSITION; DECOMPOSITION TECHNIQUE; HIGH-QUALITY SOLUTIONS; LARGE NEIGHBORHOOD SEARCH; SPATIAL DECOMPOSITIONS; TEMPORAL DECOMPOSITION; VEHICLE ROUTING PROBLEMS; VEHICLE ROUTING WITH TIME WINDOWS;

VEHICLES;

EID: 78149258340     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15396-9_11     Document Type: Conference Paper

References (29)

1. Alvarenga, G.B., Mateus, G.R., de Tomi, G.: A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Computers & Operations Research 34, 1561-1584 (2007)
2. Bent, R., Van Hentenryck, P.: A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows. Transportation Science 38(4), 515-530 (2004)
3. Bent, R., Van Hentenryck, P.: A Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows. Computers and Operations Research 33(4), 875-893 (2006) (Pubitemid 41492054)
4. Bent, R., Van Hentenryck, P.: Randomized Adaptive Spatial Decoupling For Large-Scale Vehicle Routing with Time Windows. In: Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI), Vancouver, Canada (2007)
5. Le Bouthillier, A., Crainic, T.: A Cooperative Parallel Meta-Heuristic for the Vehicle Routing Problem with Time Windows. Computers and Operations Research 32, 1685-1708 (2005)
6. Le Bouthillier, A., Crainic, T., Kropf, P.: A Guided Cooperative Search for the Vehicle Routing Problem with Time Windows. IEEE Intelligent Systems 20(4), 36-42 (2005) (Pubitemid 41263299)
7. Braysy, O.: A Reactive Variable Neighborhood Search for the Vehicle Routing Problem with Time Windows. INFORMS Journal on Computing 15(4), 347-368 (2003)
8. Braysy, O., Gendreau, M.: Vehicle Routing Problems with Time Windows, Part i: Route Construction and Local Search Algorithms. Transportation Science 39, 104-118 (2005)
9. Braysy, O., Gendreau, M.: Vehicle Routing Problems with Time Windows, Part ii: Metaheuristics. Transportation Science 39, 119-139 (2005)
10. Braysy, O., Hasle, G., Dullaert, W.: A Multi-Start Local Search for the Vehicle Routing Problem with Time Windows. European Journal of Operational Research 159(3), 586-605 (2004)
11. Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M., Soumis, F.: The VRP with Time Windows. In: The Vehicle Routing Problem: SIAM Monographs on Discrete Mathematics and Applications, pp. 157-194 (2001)
12. Crainic, T.G., Crisan, G.C., Gendreau, M., Lahrichi, N., Rei, W.: A concurrent evolutionary approach for rich combinatorial optimization. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009), pp. 2017-2022. ACM, New York (2009)
13. Espinoza, D., Garcia, R., Goycoolea, M., Nemhauser, G.L., Savelsbergh, M.: Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search. Transportation Science 42(3), 279-291 (2008)
14. Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)
15. Gehring, H., Homberger, J.: A Parallel Two-phase Metaheuristic for Routing Problems with Time Windows. Asia-Pacific Journal of Operational Research 18, 35-47 (2001) (Pubitemid 32618418)
16. Golden, B., Raghavan, S., Wasil, E.: The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, Heidelberg (2008)
17. Hunsberger, L.: Algorithms for a Temporal Decoupling Problem in Multi-Agent Planning. In: Proceedings of the Eighteenth American Conference on Artifical Intelligence (AAAI), Edmonton, Canada, pp. 468-475 (2002)
18. Lim, A., Zhang, X.: A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows. INFORMS Journal on Computing 19(3), 443-457 (2007)
19. Mester, D., Braysy, O.: Active Guided Evolution Strategies for Large Scale Vehicle Routing Problems with Time Windows. Computers and Operations Research 32, 1593-1614 (2005)
20. Mester, D., Braysy, O., Dullaert, W.: A multi-parametric evolution strategies algorithm for vehicle routing problems. Expert Systems with Applications 32, 508-517 (2007)
21. Nagataa, Y., Bysy, O., Dullaert, W.: A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Computers and Operations Research 37(4), 724-737 (2010)
22. Ostertag, A., Doerner, K., Hartl, R., Taillard, E., Waelti, P.: POPMUSIC for a real-world large-scale vehicle routing problem with time windows. Journal of the Operational Research Society 60(7), 934-943 (2009)
23. Ostertag, A., Doerner, K.F., Hartl, R.F.: A variable neighborhood search integrated in the popmusic framework for solving large scale vehicle routing problems. In: Blesa, M.J., Blum, C., Cotta, C., Fernández, A.J., Gallardo, J.E., Roli, A., Sampels, M. (eds.) HM 2008. LNCS, vol. 5296, pp. 29-42. Springer, Heidelberg (2008)
24. Pisinger, D., Ropke, S.: Large neighborhood search. In: Potvin, J.-Y., Gendreau, M. (eds.) Handbook of Metaheuristics. Springer, Heidelberg (2009)
25. Potvin, J.-Y.: A review of bio-inspired algorithms for vehicle routing. In: Pereira, F.B., Tavares, J. (eds.) SCI, ch. 1, pp. 1-34. Springer, Heidelberg (2008)
26. Prescott-Gagnon, E., Desaulniers, G., Rousseau, L.-M.: A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Networks, 1-15 (to appear)
27. Repoussis, P.P., Tarantilis, C.D., Ioannou, G.: Arc-guided evolutionary algorithm for the vehicle routing problem with time windows. IEEE Transactions on Evolutionary Computation 13(3), 624-647 (2009)
28. Rousseau, L.-M., Gendreau, M., Pesant, G.: Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows. Journal of Heuristics 8(1), 43-58 (2002) (Pubitemid 34172762)
29. Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417-431. Springer, Heidelberg (1998)