Vehicle Routing Problem
A distribution center has several vehicles and many customers. Which customers should each vehicle serve, and in what order, to minimize the total travel distance?
Build a delivery problem
The square point is the depot. All vehicles start from and return to the same depot.
How QPRIMORA understands VRP
See the transformation layer
A · CUSTOMER ASSIGNMENT
The first question is no longer only route order. For every customer i and vehicle v, we need an assignment decision.
y(i,v)=1 means customer i is assigned to vehicle v.
B · ROUTE VARIABLES
The system then decides whether vehicle v travels directly from location i to location j.
C · CONSTRAINTS
D · OBJECTIVE
Minimize the total distance travelled by all vehicles.
E · QUBO
Distance, customer assignment and route constraints can be encoded into one quadratic binary objective.
F · QAOA + VIRTUAL QPU
The optimization path attempts to increase the measurement probability of lower-cost vehicle-routing states.
Run both approaches
Exact Search
Virtual QPU
Why is VRP harder than TSP?
First decide which vehicle serves each customer.
Then optimize the visiting order inside every vehicle route.
Changing one customer's vehicle can change several optimal routes.
From logistics intent to QPU execution
Users describe the logistics objective. QPRIMORA handles the path toward a quantum-executable representation.