IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v55y2025i2p121-136.html
   My bibliography  Save this article

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
    ---><---

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.