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

Reza Rahimi Baghbadorani and Mohammad Haeri

International Journal of Logistics Systems and Management, 2025, vol. 50, issue 1, 28-50

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.

Keywords: vehicle routing problem; VRP; classic MDVRP; receding horizon; dynamic MDVRP; capacitated clustering. (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=143890 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijlsma:v:50:y:2025:i:1:p:28-50

Access Statistics for this article

More articles in International Journal of Logistics Systems and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().