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

Authors: Reza Rahimi Baghbadorani; Mohammad Haeri

Addresses: Advanced Control Systems Lab, Sharif University of Technology, Tehran, Iran ' Advanced Control Systems Lab, Sharif University of Technology, Tehran, Iran

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.

DOI: 10.1504/IJLSM.2025.143890

International Journal of Logistics Systems and Management, 2025 Vol.50 No.1, pp.28 - 50

Received: 18 Jan 2022
Accepted: 09 Jun 2022
Published online: 13 Jan 2025 *