Graph-Coarsening Approach for the Capacitated Vehicle Routing Problem with Time Windows

arXiv:2510.22329v2 Announce Type: replace Abstract: The Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) is a fundamental NP-hard optimization problem in logistics. Solving large-scale instances remains computationally challenging for exact solvers. This paper introduces a multilevel graph coarsening and refinement strategy that aggregates customers into meta-nodes based on a spatio-temporal distance metric. The reduced problem is solved using both classical heuristics and quantum