A Branch-Price-and-Cut Algorithm for the Multicommodity Two-Echelon Vehicle Routing Problem with Time Windows

References

• Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5):1269–1283.Link, Google Scholar
• Baldacci R, Mingozzi A, Roberti R, Calvo RW (2013) An exact algorithm for the two-echelon capacitated vehicle routing problem. Oper. Res. 61(2):298–314.Link, Google Scholar
• Ben Amor H, Desrosiers J, Carvalho J (2006) Dual-optimal inequalities for stabilized column generation. Oper. Res. 54(3):454–463.Link, Google Scholar
• Boland N, Dethridge J, Dumitrescu I (2006) Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Oper. Res. Lett. 34(1):58–68.Crossref, Google Scholar
• Breunig U, Schmid V, Hartl R, Vidal T (2016) A large neighbourhood based heuristic for two-echelon routing problems. Comput. Oper. Res. 76:208–225.Crossref, Google Scholar
• Costa L, Contardo C, Desaulniers G (2019) Exact branch-price-and-cut algorithms for vehicle routing. Transportation Sci. 53(4):946–985.Link, Google Scholar
• Crainic TG, Mancini S, Perboli G, Tadei R (2008) Clustering-based heuristics for the two-echelon vehicle routing problem. Technical Report CIRRELT-2008-46, CIRRELT, Montreal, Canada.Google Scholar
• Crainic TG, Mancini S, Perboli G, Tadei R (2011) Multi-start heuristics for the two-echelon vehicle routing problem. Merz P, Hao JK, eds. Evolutionary Computation in Combinatorial Optimization (Springer, Berlin), 179–190.Crossref, Google Scholar
• Cuda R, Guastaroba G, Speranza M (2015) A survey on two-echelon routing problems. Comput. Oper. Res. 55:185–199.Crossref, Google Scholar
• Dellaert N, Dashty Saridarq F, Van Woensel T, Crainic TG (2019) Branch-and-price–based algorithms for the two-echelon vehicle routing problem with time windows. Transportation Sci. 53(2):463–479.Link, Google Scholar
• Dellaert N, Van Woensel T, Crainic TG, Saridarq FD (2021) A multi-commodity two-echelon capacitated vehicle routing problem with time windows: Model formulations and solution approach. Comput. Oper. Res. 127:105154.Crossref, Google Scholar
• Drexl M (2012) Synchronization in vehicle routing—A survey of VRPs with multiple synchronization constraints. Transportation Sci. 46(3):297–316.Link, Google Scholar
• Dumez D, Tilk C, Irnich S, Lehuédé F, Olkis K, Péton O (2023) A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows. Eur. J. Oper. Res. 305(1):64–84.Crossref, Google Scholar
• Gschwind T, Irnich S (2016) Dual inequalities for stabilized column generation revisited. INFORMS J. Comput. 28(1):175–194.Link, Google Scholar
• Gu W, Archetti C, Cattaruzza D, Ogier M, Semet F, Speranza MG (2022) A sequential approach for a multi-commodity two-echelon distribution problem. Comput. Indust. Engrg. 163:107793.Crossref, Google Scholar
• Guastaroba G, Speranza MG, Vigo D (2016) Intermediate facilities in freight transportation planning: A survey. Transportation Sci. 50(3):763–789.Link, Google Scholar
• Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. Desaulniers G, Desrosiers J, Solomon MM, eds. Column Generation, 1st ed. (Springer, Boston), 33–65.Crossref, Google Scholar
• Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56(2):497–511.Link, Google Scholar
• Jia S, Deng L, Zhao Q, Chen Y (2023) An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization. J. Indust. Management Optim. 19(2):1187–1210.Crossref, Google Scholar
• Laporte G, Nobert Y (1983) A branch and bound algorithm for the capacitated vehicle routing problem. OR Spektrum 5(2):77–85.Crossref, Google Scholar
• Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming 100(2):423–445.Crossref, Google Scholar
• Marques G, Sadykov R, Deschamps JC, Dupas R (2020) An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. Comput. Oper. Res. 114:104833.Crossref, Google Scholar
• Marques G, Sadykov R, Dupas R, Deschamps JC (2022) A branch-cut-and-price approach for the single-trip and multi-trip two-echelon vehicle routing problem with time windows. Transportation Sci. 56(6):1598–1617.Link, Google Scholar
• Mhamedi T, Cherkesly M, Desaulniers G (2026) A branch-price-and-cut algorithm for the multicommodity two-echelon vehicle routing problem with time windows. https://doi.org/10.1287/ijoc.2024.1010.cd, https://github.com/INFORMSJoC/2024.1010.Google Scholar
• Mhamedi T, Andersson H, Cherkesly M, Desaulniers G (2022) A branch-price-and-cut algorithm for the two-echelon vehicle routing problem with time windows. Transportation Sci. 56(1):245–264.Link, Google Scholar
• Perboli G, Tadei R, Vigo D (2011) The two-echelon capacitated vehicle routing problem: Models and math-based heuristics. Transportation Sci. 45(3):364–380.Link, Google Scholar
• Petris M, Archetti C, Cattaruzza D, Ogier M, Semet F (2024) A branch-price-and-cut algorithm for the multi-commodity two-echelon distribution problem. EURO J. Transportation Logist. 13:100139.Crossref, Google Scholar
• Righini G, Salani M (2008) New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3):155–170.Crossref, Google Scholar
• Santos FA, Mateus GR, da Cunha AS (2015) A branch-and-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. Transportation Sci. 49(2):355–368.Link, Google Scholar
• Sluijk N, Florio AM, Kinable J, Dellaert N, Van Woensel T (2023) Two-echelon vehicle routing problems: A literature review. Eur. J. Oper. Res. 304(3):865–886.Crossref, Google Scholar
• Soares R, Marques A, Amorim P, Parragh SN (2024) Synchronisation in vehicle routing: Classification schema, modelling framework and literature review. Eur. J. Oper. Res. 313(3):817–840.Crossref, Google Scholar