CVRP | MDVRP | PVRP | SDVRP | SVRP | VRPB | VRPPD | VRPSF | VRPTW

Multiple Depot VRP (MDVRP)

 

A company may have several depots from which it can serve its customers. If the customers are clustered around depots, then the distribution problem should be modeled as a set of independent VRPs. However, if the customers and the depots are intermingled then a Multi-Depot Vehicle Routing Problem should be solved.

A MDVRP requires the assignment of customers to depots. A fleet of vehicles is based at each depot. Each vehicle originate from one depot, service the customers assigned to that depot, and return to the same depot.

The objective of the problem is to service all customers while minimizing the number of vehicles and travel distance.

We can find below a formal description for the MDVRP:


CVRP | MDVRP | PVRP | SDVRP | SVRP | VRPB | VRPPD | VRPSF | VRPTW