A Graph Matching Based Approach for the Multi-Depot Capacitated Vehicle Routing Problem
The Multi-Depot Capacitated Vehicle Routing Problem (MDCVRP) asks for minimum-cost delivery tours from several capacitated depots to a set of customers. Like most vehicle-routing variants it is NP-hard, so practical solvers must trade solution quality against speed. We revisit this trade-off through the lens of graph m...