papersSEP 10 04:00 UTC
GNN-guided graph coarsening cuts QUBO size for quantum-annealed vehicle routing
An arXiv paper pairs graph neural network-guided coarsening with adaptive penalty tuning to shrink the QUBO formulations that arise when capacitated vehicle routing problems with time windows are solved on a quantum annealer. Customers that are geographically close and have compatible delivery windows are merged into super-nodes, reducing the number of binary variables before the problem reaches the annealer. The goal is to make quantum annealing tractable for larger, more realistic logistics instances.