Abstract
This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive decomposition scheme which iteratively decouples a routing problem based on the current solution. Earlier work considered vehicle-based decompositions that partitions the vehicles across the subproblems. The subproblems can then be optimized independently and merged easily. This paper argues that vehicle-based decompositions, although very effective on various problem classes also have limitations. In particular, they do not accommodate temporal decompositions and may produce spatial decompositions that are not focused enough. This paper then proposes customer-based decompositions which generalize vehicle-based decouplings and allows for focused spatial and temporal decompositions. Experimental results on class R2 of the extended Solomon benchmarks demonstrates the benefits of the customer-based adaptive decomposition scheme and its spatial, temporal, and hybrid instantiations. In particular, they show that customer-based decompositions bring significant benefits over large neighborhood search in contrast to vehicle-based decompositions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
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)
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)
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)
Braysy, O.: A Reactive Variable Neighborhood Search for the Vehicle Routing Problem with Time Windows. INFORMS Journal on Computing 15(4), 347–368 (2003)
Braysy, O., Gendreau, M.: Vehicle Routing Problems with Time Windows, Part i: Route Construction and Local Search Algorithms. Transportation Science 39, 104–118 (2005)
Braysy, O., Gendreau, M.: Vehicle Routing Problems with Time Windows, Part ii: Metaheuristics. Transportation Science 39, 119–139 (2005)
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)
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)
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)
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)
Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)
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)
Golden, B., Raghavan, S., Wasil, E.: The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, Heidelberg (2008)
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)
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)
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)
Mester, D., Braysy, O., Dullaert, W.: A multi-parametric evolution strategies algorithm for vehicle routing problems. Expert Systems with Applications 32, 508–517 (2007)
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)
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)
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)
Pisinger, D., Ropke, S.: Large neighborhood search. In: Potvin, J.-Y., Gendreau, M. (eds.) Handbook of Metaheuristics. Springer, Heidelberg (2009)
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)
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)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bent, R., Van Hentenryck, P. (2010). Spatial, Temporal, and Hybrid Decompositions for Large-Scale Vehicle Routing with Time Windows. In: Cohen, D. (eds) Principles and Practice of Constraint Programming – CP 2010. CP 2010. Lecture Notes in Computer Science, vol 6308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15396-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-15396-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15395-2
Online ISBN: 978-3-642-15396-9
eBook Packages: Computer ScienceComputer Science (R0)