Multilevel graph coarsening for CVRPTW aggregates customers via spatio-temporal metric, solves reduced instances with classical heuristics and quantum annealing, then refines, showing reduced solve time on Solomon benchmarks with quality gains on clustered instances.
Vehicle routing problem with time windows based on spatiotemporal distance,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Graph-Coarsening Approach for the Capacitated Vehicle Routing Problem with Time Windows
Multilevel graph coarsening for CVRPTW aggregates customers via spatio-temporal metric, solves reduced instances with classical heuristics and quantum annealing, then refines, showing reduced solve time on Solomon benchmarks with quality gains on clustered instances.