Heuristics and Meta-Heuristics Based Multiple Depot Vehicle Routing Problem: A Review

Nowadays distribution of goods for the delivery industries has become very costly. The problem focusing the distribution of products between depots and clients are commonly addressed by vehicle routing problem (VRP). The multi depot VRP, an extended form of VRP, is NP-hard trouble for concurrently finding all possible routes for various transports from more than one depot to a group of clients and back to the very same depot. In this work, an updated review on the MDVRP is illustrated. In this overview of the research papers, many versions of the model are investigated such as split-delivery, periodic-deliveries, capacitated, time windows, heterogeneous fleet, and pickup & delivery.