Solving the multi depot vehicle routing problem with assignment algorithm

Abstract

The Vehicle Routing Problem (VRP) involves the design of a set of minimum cost vehicle routes,
originating and terminating at a central depot, for a fleet of vehicles that services a set of customers
with known demands. This study contains some information about Logistics and Supply Chain
Management. In the second part Distribution Management, which is a more related subject with
Vehicle Routing, has been explained in a detailed way. The last part of the study contains cluster-firstroutesecond heuristics for the Multi Depot Vehicle Routing Problem (MDVRP). For this problem has been constructed an assignment algorithm and this algorithm has been solved by LINGO.