A Branch and Price Algorithm for the Heterogeneous Fleet Multi-Depot Multi-Trip Vehicle Routing Problem with Time Windows

References

• Azi N, Gendreau M, Potvin JY (2010) An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur. J. Oper. Res. 202(3):756–763.Crossref, Google Scholar
• 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
• Bettinelli A, Ceselli A, Righini G (2011) A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transportation Res., Part C Emerging Tech. 19(5):723–740.Crossref, Google Scholar
• Boland NL, Clarke LW, Nemhauser GL (2000) The asymmetric traveling salesman problem with replenishment arcs. Eur. J. Oper. Res. 123(2):408–427.Crossref, 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
• Boysen N, Fedtke S, Schwerdfeger S (2020) Last-mile delivery concepts: a survey from an operational research perspective. OR Spectrum 43(1):1–58.Google Scholar
• Cattaruzza D, Absi N, Feillet D (2016) Vehicle routing problems with multiple trips. 4OR 14(3):223–259.Crossref, Google Scholar
• Cattaruzza D, Absi N, Feillet D, Vigo D (2014) An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows. Comput. Oper. Res. 51:257–267.Crossref, Google Scholar
• Contardo C, Martinelli R (2014) A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optim. 12:129–146.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
• Dash S, Günlük O, Lodi A, Tramontani A (2012) A time bucket formulation for the traveling salesman problem with time windows. INFORMS J. Comput. 24(1):132–147.Link, Google Scholar
• Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44(3):216–229.Crossref, Google Scholar
• Gevaers R, Van de Voorde E, Vanelslander T (2009) Characteristics of innovations in last-mile logistics-using best practices, case studies and making the link with green and sustainable logistics. Assoc. Eur. Transport Contributors 1:21.Google Scholar
• Groot RD (2007) Design Manual for Bicycle Traffic. Number 25.Google Scholar
• Hernandez F, Feillet D, Giroudeau R, Naud O (2014) A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration. 4OR 12(3):235–259.Crossref, Google Scholar
• Hernandez F, Feillet D, Giroudeau R, Naud O (2016) Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows. Eur. J. Oper. Res. 249(2):551–559.Crossref, Google Scholar
• Koç Ç, Bektaş T, Jabali O, Laporte G (2016) Thirty years of heterogeneous vehicle routing. Eur. J. Oper. Res. 249(1):1–21.Crossref, Google Scholar
• Kohl N (1995) Exact methods for time constrained routing and related scheduling problems. PhD thesis, Technical University of Denmark, Kongens Lyngby, Denmark.Google Scholar
• Lloyd S (1982) Least squares quantization in pcm. IEEE Trans. Inform. Theory 28(2):129–137.Crossref, Google Scholar
• Macedo R, Alves C, de Carvalho JV, Clautiaux F, Hanafi S (2011) Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. Eur. J. Oper. Res. 214(3):536–545.Crossref, Google Scholar
• Montoya-Torres JR, Franco JL, Isaza SN, Jiménez HF, Herazo-Padilla N (2015) A literature review on the vehicle routing problem with multi-ple depots. Comput. Industrial Engrg. 79:115–129.Crossref, Google Scholar
• Paradiso R, Roberti R, Laganá D, Dullaert W (2020) An exact solution framework for multi-trip vehicle-routing problems with time windows. Oper. Res. 68(1):180–198.Link, Google Scholar
• Pecin D, Pessoa A, Poggi M, Uchoa E (2017) Improved branch-cut-and-price for capacitated vehicle routing. Math. Programming Comput. 9(1):61–100.Crossref, Google Scholar
• Pucher J, Dill J, Handy S (2010) Infrastructure, programs, and policies to increase bicycling: An international review. Preventive Medicine 50:S106–S125.Crossref, Google Scholar
• Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254–265.Link, Google Scholar
• Vision Monday (2021) E-commerce share of total global retail sales from 2015 to 2024. Accessed August 9, 2021, https://www.statista.com/statistics/534123/e-commerce-share-of-retail-sales-worldwide/.Google Scholar