IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v55y2025i2p121-136.html

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

Author

Listed:
  • Kishan Thakkar

    (Operations Research Department, Delhivery Limited, Bengaluru, Karnataka 560025, India)

  • Purvi Rastogi

    (Operations Research Department, Delhivery Limited, Bengaluru, Karnataka 560025, India)

  • Sarada P. Sarmah

    (Department of Industrial and Systems Engineering, Indian Institute of Technology Kharagpur, Kharagpur, West Bengal 721302, India)

Abstract

This study demonstrates the application of operations research techniques to enhance the operational efficiency of a large logistics network. The focus is on addressing a variant of the vehicle routing problem faced by Delhivery, a leading logistics company in India, to improve its midmile operations. The problem involves enhancing a complex distribution network with more than 3,000 locations, which can be closely described as a multidepot fleet size and mix site-dependent asymmetric distance-constrained vehicle routing problem with time windows. The study also considers the geographic scope of the network, which has not been previously explored in the literature. A novel mixed integer linear programming formulation is presented along with a powerful hybrid evolutionary search algorithm that has been tested in many real-world routing problems. Additionally, a novel insertion algorithm that significantly reduces computational time is introduced. Furthermore, the capabilities of the algorithm are expanded to determine the optimal locations for new hubs within Delhivery’s network. The proposed algorithm achieves significant cost savings of nearly 7.3% and offers various managerial advantages. The algorithm converges rapidly and automates the entire planning and operations process, resulting in improved overall efficiency.

Suggested Citation

  • Kishan Thakkar & Purvi Rastogi & Sarada P. Sarmah, 2025. "Optimizing Delhivery’s Midmile Logistics Network Using a Hybrid Evolutionary Search Algorithm," Interfaces, INFORMS, vol. 55(2), pages 121-136, March.
    • Handle: RePEc:inm:orinte:v:55:y:2025:i:2:p:121-136
    DOI: 10.1287/inte.2023.0049
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.2023.0049
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.2023.0049?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    2. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    3. Baozhen Yao & Bin Yu & Ping Hu & Junjie Gao & Mingheng Zhang, 2016. "An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot," Annals of Operations Research, Springer, vol. 242(2), pages 303-320, July.
    4. Teodor Gabriel Crainic & Nicoletta Ricciardi & Giovanni Storchi, 2009. "Models for Evaluating and Planning City Logistics Systems," Transportation Science, INFORMS, vol. 43(4), pages 432-454, November.
    5. Haoyuan Hu & Ying Zhang & Jiangwen Wei & Yang Zhan & Xinhui Zhang & Shaojian Huang & Guangrui Ma & Yuming Deng & Siwei Jiang, 2022. "Alibaba Vehicle Routing Algorithms Enable Rapid Pick and Delivery," Interfaces, INFORMS, vol. 52(1), pages 27-41, January.
    6. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2014. "A unified solution framework for multi-attribute vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 234(3), pages 658-673.
    7. Chuck Holland & Jack Levis & Ranganath Nuggehalli & Bob Santilli & Jeff Winters, 2017. "UPS Optimizes Delivery Routes," Interfaces, INFORMS, vol. 47(1), pages 8-23, February.
    8. Zakir Hussain Ahmed & Asaad Shakir Hameed & Modhi Lafta Mutar & Shimin Wang, 2022. "Hybrid Genetic Algorithms for the Asymmetric Distance-Constrained Vehicle Routing Problem," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-20, June.
    9. Pedro Amorim & Sophie Parragh & Fabrício Sperandio & Bernardo Almada-Lobo, 2014. "A rich vehicle routing problem dealing with perishable food: a case study," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(2), pages 489-508, July.
    10. Guido Perboli & Roberto Tadei & Daniele Vigo, 2011. "The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics," Transportation Science, INFORMS, vol. 45(3), pages 364-380, August.
    11. Demir, Emrah & Bektaş, Tolga & Laporte, Gilbert, 2012. "An adaptive large neighborhood search heuristic for the Pollution-Routing Problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 346-359.
    12. Yibo Dang & Manjeet Singh & Theodore T. Allen, 2021. "Network Mode Optimization for the DHL Supply Chain," Interfaces, INFORMS, vol. 51(3), pages 179-199, May.
    13. François, Véronique & Arda, Yasemin & Crama, Yves & Laporte, Gilbert, 2016. "Large neighborhood search for multi-trip vehicle routing," European Journal of Operational Research, Elsevier, vol. 255(2), pages 422-441.
    14. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm," European Journal of Operational Research, Elsevier, vol. 248(1), pages 33-51.
    15. Goel, Asvin & Gruhn, Volker, 2008. "A General Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 650-660, December.
    16. Puca Huachi Vaz Penna & Anand Subramanian & Luiz Satoru Ochi & Thibaut Vidal & Christian Prins, 2019. "A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet," Annals of Operations Research, Springer, vol. 273(1), pages 5-74, February.
    17. Goos Kant & Michael Jacks & Corné Aantjes, 2008. "Coca-Cola Enterprises Optimizes Vehicle Routes for Efficient Product Delivery," Interfaces, INFORMS, vol. 38(1), pages 40-50, February.
    18. M. W. P. Savelsbergh & M. Sol, 1995. "The General Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 29(1), pages 17-29, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Puca Huachi Vaz Penna & Anand Subramanian & Luiz Satoru Ochi & Thibaut Vidal & Christian Prins, 2019. "A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet," Annals of Operations Research, Springer, vol. 273(1), pages 5-74, February.
    2. Dayarian, Iman & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2016. "An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 95(C), pages 95-123.
    3. Niklas Tuma & Manuel Ostermeier & Alexander Hübner, 2024. "Optimal Transportation Planning for a Do-It-Yourself Retailer with a Zone-Based Tariff," Interfaces, INFORMS, vol. 54(4), pages 312-328, July.
    4. Schaumann, Sarah K. & Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2023. "Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics," European Journal of Operational Research, Elsevier, vol. 311(1), pages 88-111.
    5. Jiang, Yupeng & Hu, Wei & Gu, Wenjuan & Yu, Yongguang & Xu, Meng, 2025. "A multi-mode hybrid electric vehicle routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 195(C).
    6. Li, Jian & Cang, Lu & Wu, Yisheng & Zhang, Zhaotong, 2025. "Two-echelon collaborative many-to-many pickup and delivery problem for agricultural wholesale markets with workload balance," Omega, Elsevier, vol. 130(C).
    7. Maximilian Schiffer & Grit Walther, 2018. "An Adaptive Large Neighborhood Search for the Location-routing Problem with Intra-route Facilities," Transportation Science, INFORMS, vol. 52(2), pages 331-352, March.
    8. Pan, Binbin & Zhang, Zhenzhen & Lim, Andrew, 2021. "Multi-trip time-dependent vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 291(1), pages 218-231.
    9. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    10. Hatzenbühler, Jonas & Jenelius, Erik & Gidófalvi, Gyözö & Cats, Oded, 2023. "Modular vehicle routing for combined passenger and freight transport," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
    11. Liu, Yiming & Yu, Yang & Baldacci, Roberto & Tang, Jiafu & Sun, Wei, 2025. "Optimizing carbon emissions in green logistics for time-dependent routing," Transportation Research Part B: Methodological, Elsevier, vol. 192(C).
    12. Li, Hongqi & Wang, Haotian & Chen, Jun & Bai, Ming, 2020. "Two-echelon vehicle routing problem with time windows and mobile satellites," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 179-201.
    13. Imen Ben Mohamed & Walid Klibi & Olivier Labarthe & Jean-Christophe Deschamps & Mohamed Zied Babai, 2017. "Modelling and solution approaches for the interconnected city logistics," International Journal of Production Research, Taylor & Francis Journals, vol. 55(9), pages 2664-2684, May.
    14. Nan Ding & Manman Li & Jianming Hao, 2023. "A Two-Phase Approach to Routing a Mixed Fleet with Intermediate Depots," Mathematics, MDPI, vol. 11(8), pages 1-21, April.
    15. Wu, Guoyuan & Peng, Dongbo & Boriboonsomsin, Kanok, 2024. "Developing an Efficient Dispatching Strategy to Support Commercial Fleet Electrification," Institute of Transportation Studies, Working Paper Series qt2qz0n2gv, Institute of Transportation Studies, UC Davis.
    16. Hammami, Farouk & Rekik, Monia & Coelho, Leandro C., 2019. "Exact and heuristic solution approaches for the bid construction problem in transportation procurement auctions with a heterogeneous fleet," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 150-177.
    17. Sluijk, Natasja & Florio, Alexandre M. & Kinable, Joris & Dellaert, Nico & Van Woensel, Tom, 2023. "Two-echelon vehicle routing problems: A literature review," European Journal of Operational Research, Elsevier, vol. 304(3), pages 865-886.
    18. Jie, Wanchen & Yang, Jun & Zhang, Min & Huang, Yongxi, 2019. "The two-echelon capacitated electric vehicle routing problem with battery swapping stations: Formulation and efficient methodology," European Journal of Operational Research, Elsevier, vol. 272(3), pages 879-904.
    19. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
    20. Yu, Vincent F. & Anh, Pham Tuan & Baldacci, Roberto, 2023. "A robust optimization approach for the vehicle routing problem with cross-docking under demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orinte:v:55:y:2025:i:2:p:121-136. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.