Optimizing Delhivery’s Midmile Logistics Network Using a Hybrid Evolutionary Search Algorithm

References

• Ahmed ZH, Hameed AS, Mutar ML (2022) Hybrid genetic algorithms for the asymmetric distance-constrained vehicle routing problem. Math. Problems Engrg. 2022(1):1–20.Google Scholar
• Amorim P, Parragh SN, Sperandio F, Almada-Lobo B (2014) A rich vehicle routing problem dealing with perishable food: A case study. TOP 22(2):489–508.Google Scholar
• Baldacci R, Battarra M, Vigo D (2008) Routing a heterogeneous fleet of vehicles. Golden B, Raghavan S, Wasil E, eds. The Vehicle Routing Problem: Latest Advances and New Challenges, Operations Research/Computer Science Interfaces, vol. 43 (Springer, Boston), 3–27.Google Scholar
• Ban H-B, Nguyen PK (2021) A hybrid metaheuristic for solving asymmetric distance-constrained vehicle routing problem. Comput. Soc. Networks 8(1):3.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.Google Scholar
• Crainic TG, Ricciardi N, Storchi G (2009) Models for evaluating and planning city logistics systems. Transportation Sci. 43(4):432–454.Link, Google Scholar
• Crainic TG, Perboli G, Mancini S, Tadei R (2010) Two-echelon vehicle routing problem: A satellite location analysis. Procedia Soc. Behav. Sci. 2(3):5944–5955.Google Scholar
• Dang Y, Singh M, Allen TT (2021) Network mode optimization for the DHL supply chain. INFORMS J. Appl. Anal. 51(3):179–199.Link, Google Scholar
• Dantzig GB, Ramser JH (1959) The truck dispatching problem. Management Sci. 6(1):80–91.Link, Google Scholar
• de Armas J, Melián-Batista B, Moreno-Pérez JA, Brito J (2015) GVNS for a real-world rich vehicle routing problem with time windows. Engrg. Appl. Artificial Intelligence 42:45–56.Google Scholar
• Delhivery (2023) About Delhivery. Accessed July 10, https://www.delhivery.com/about-us/.Google Scholar
• Demir E, Bektaş T, Laporte G (2012) An adaptive large neighborhood search heuristic for the pollution-routing problem. Eur. J. Oper. Res. 223(2):346–359.Google Scholar
• Dondo R, Cerdá J (2006) A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows. Internat. Trans. Oper. Res. 13(5):441–459.Google Scholar
• François V, Arda Y, Crama Y, Laporte G (2016) Large neighborhood search for multi-trip vehicle routing. Eur. J. Oper. Res. 255(2):422–441.Google Scholar
• Goel A, Gruhn V (2008) A general vehicle routing problem. Eur. J. Oper. Res. 191(3):650–660.Google Scholar
• Hoff A, Andersson H, Christiansen M, Hasle G, Løkketangen A (2010) Industrial aspects and literature survey: Fleet composition and routing. Comput. Oper. Res. 37(12):2041–2061.Google Scholar
• Holland C, Levis J, Nuggehalli R, Santilli B, Winters J (2017) UPS optimizes delivery routes. Interfaces 47(1):8–23.Link, Google Scholar
• Hu H, Zhang Y, Wei J, Zhan Y, Zhang X, Huang S, Ma G, Deng Y, Jiang S (2022) Alibaba vehicle routing algorithms enable rapid pick and delivery. INFORMS J. Appl. Anal. 52(1):27–41.Link, Google Scholar
• JSprit (2023) A java based, open-source toolkit for solving vehicle routing problems. Accessed July 10, 2023, https://jsprit.github.io/.Google Scholar
• Kant G, Jacks M, Aantjes C (2008) Coca-Cola Enterprises optimizes vehicle routes for efficient product delivery. Interfaces 38(1):40–50.Link, Google Scholar
• Koç Ç, Bektaş T, Jabali O, Laporte G (2015) A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows. Comput. Oper. Res. 64:11–27.Google Scholar
• Koç Ç, Bektaş T, Jabali O, Laporte G (2016) The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm. Eur. J. Oper. Res. 248(1):33–51.Google Scholar
• Laporte G (1984) Optimal solutions to capacitated multidepot vehicle routing problems. Congressus Nemerantium 4:283–292.Google Scholar
• Laporte G, Musmanno R, Vocaturo F (2010) An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands. Transportation Sci. 44(1):125–135.Link, Google Scholar
• Laporte G, Nobert Y, Taillefer S (1987) A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem. Math. Model. 9(12):857–868.Google Scholar
• Mancini S (2012) The two-echelon vehicle routing problem. 4OR 10(4):391–392.Google Scholar
• Mancini S (2016) A real-life multi depot multi period vehicle routing problem with a heterogeneous fleet: Formulation and adaptive large neighborhood search based matheuristic. Transportation Res. Part C Emerging Tech. 70:100–112.Google Scholar
• Nag BN (1988) Vehicle Routing in the Presence of Site/Vehicle Dependency Constraints (University of Maryland, College Park).Google Scholar
• Penna PHV, Subramanian A, Ochi LS, Vidal T, Prins C (2019) A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet. Ann. Oper. Res. 273(1–2):5–74.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
• Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8):2403–2435.Google Scholar
• Pisinger D, Ropke S (2010) Large neighborhood search. Gendreau M, Potvin J-Y, eds. Handbook of Metaheuristics, International Series in Operations Research & Management Science, vol. 272 (Springer, Cham, Switzerland), 399–419.Google Scholar
• Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12):1985–2002.Google Scholar
• Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40(4):455–472.Link, Google Scholar
• Sahoo S, Kim S, Kim BI, Kraas B, Popov A Jr (2005) Routing optimization for waste management. Interfaces 35(1):24–36.Link, Google Scholar
• Savelsbergh MWP, Sol M (1995) The general pickup and delivery problem. Transportation Sci. 29(1):17–29.Link, Google Scholar
• Vidal T, Crainic TG, Gendreau M, Prins C (2014) A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234(3):658–673.Google Scholar
• Yao B, Yu B, Hu P, Gao J, Zhang M (2016) An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot. Ann. Oper. Res. 242(2):303–320.Google Scholar