Multi-Depot Vehicle Routing Problem: A Comprehensive Review

Resumen

Transportation plays a significant role in today’s era. To ensure on-time delivery in logistics, it is crucial to effectively manage the delivery fleet. This review paper presents a comprehensive analysis of 79 research studies related to single-depot and multi-depot vehicle routing problems. Among these, 42 papers focus on models without time windows, while 33 papers address problems that include time window constraints and one is review paper based both time and without window constraint. In terms of problem structure, 59 papers are based on multi-depot vehicle routing problems, 17 papers consider single-depot vehicle routing problem with one review paper related to the single vehicle routing problem and 3 papers based on complexity classes and comparison of some classification algorithms. Moreover, the study contains different solution approaches that solve NP-hard problems. The main purpose of this review is to identify trends, methodologies, and key developments in the field of vehicle routing problems. Additionally, comparative differences between models with and without time windows and between single and multi-depot vehicle routing problems is also explored.