The vehicle routing problem (VRP) is one of the most studied problems in the field of optimization and operations research. In this comparison, we present a few studies on the multiple depot vehicle routing problem (MDVRP). This comparison considers several variants : time windows, split delivery, heterogeneous fleet, periodic deliveries, and pick-up and delivery. It also classifies the approaches according to the single or multiple objectives that are optimized.
ORKG Comparisons have changed. We have added new features and improved the user interface. Comparisons might look slightly different, but the comparison data itself remains unchanged.