Multi-depot vehicle routing problem: a case study of regional distribution network in Thailand

Efficient distribution management is a critical challenge for retail supply chains operating in large urban regions. In Thailand, a case study retail chain within the Bangkok Metropolitan Region (BMR) rely on daily deliveries from multiple depots, yet current delivery planning often leads to redundant travel distances, high fuel costs, and scheduling inefficiencies. This study investigates the Multi-Depot Vehicle Routing Problem (MDVRP) in the context of a case study retail chain distribution network, aiming to minimize total transportation cost and travel distance while improving route scheduling.The research employs Open Solver in Microsoft Excel as the primary optimization tool to formulate and solve the MDVRP model. The approach considers multiple depots, heterogeneous store demands, and regional traffic conditions in Bangkok, with an emphasis on vehicle assignment, route sequencing, and scheduling efficiency. The results highlight optimized delivery routes that significantly reduce overall distribution costs compared to conventional planning methods.This study contributes to the field of logistics and supply chain systems engineering by demonstrating a practical application of VRP optimization techniques in a real-world retail distribution context. Moreover, it provides managerial insights for multi-depot logistics networks in urban settings, offering decision-makers a framework to improve operational efficiency, reduce distance, and enhance service reliability in last-mile delivery.