IDEAS home Printed from https://ideas.repec.org/a/ids/ijlsma/v50y2025i1p28-50.html
   My bibliography  Save this article

An innovative method to solve classic and dynamic multi-depot vehicle routing problem

Author

Listed:
  • Reza Rahimi Baghbadorani
  • Mohammad Haeri

Abstract

A significant part of distribution companies' final interest and cost is related to delivering goods to customers. Due to constraints on service hours and service distances, logistics companies usually build multiple depots to serve a large number of dispersed customers. This is why multi-depot vehicle routing problems (MDVRP) win more and more companies' attention to thrift their cost. In this research, first, we address a classic form of MDVRP and ponder its solution. A tuning parameter is introduced to trade-off between the final and computation costs. Then, considering issues like traffic congestion variations, increasing or decreasing number of customers, and other uncertainties, dynamic MDVRP is analysed. A receding horizon approach is proposed, and its performance in three scenarios is investigated. Simulation results show that the proposed algorithm is feasible and efficient to solve the dynamic MDVRP.

Suggested Citation

  • Reza Rahimi Baghbadorani & Mohammad Haeri, 2025. "An innovative method to solve classic and dynamic multi-depot vehicle routing problem," International Journal of Logistics Systems and Management, Inderscience Enterprises Ltd, vol. 50(1), pages 28-50.
    • Handle: RePEc:ids:ijlsma:v:50:y:2025:i:1:p:28-50
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=143890
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijlsma:v:50:y:2025:i:1:p:28-50. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=134 .

    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.