Get Started
Home
Topics
Search
Library
Research questionHow can quantum-annealing QUBOs for vehicle routing with time windows be reduced while preserving feasibility?Vehicle-routing QUBOs can become too large for practical annealing, while merging customers may create infeasible expanded routes. Penalty scaling and variation between instance families further affect whether sampled solutions satisfy the constraints.
AI
Evaluation & Benchmarks
Machine Learning
Research Paper
Technology
Latest papersRecent research connected to this question, newest first.GNN-Guided Graph Coarsening and Adaptive QUBO Penalties for the Capacitated Vehicle Routing Problem with Time Windows on a Quantum AnnealerThe source combines time-window-compatible customer coarsening with adaptive penalty calibration and tests the resulting formulations using simulated annealing and a D-Wave processor on Solomon instances. Routes are expanded to the original customers and compared with classical repair and local search; conclusions are limited to those instances, solver settings, and feasibility-focused evaluations.research paper · Sep 9, 2026
Related questions
How can learned vehicle-routing solvers handle hard constraints without handcrafted heuristics or expensive exact optimization?How can we find minimal road-network changes that make a user-selected route optimal?How can a navigation map encode heterogeneous route costs compactly while answering new goals without retraining?How can interdependent heuristic components be jointly evolved without incompatible search behavior in routing optimization?