QPRIMORA · QUANTUM COMPUTING DEMO

Vehicle Routing Problem

Vehicle Routing Problem · VRP

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?

VRP adds another decision layer beyond TSP: the system must determine both customer allocation and visiting order.
01 · YOUR PROBLEM

Build a delivery problem

6

The square point is the depot. All vehicles start from and return to the same depot.

Delivery map
02 · QPRIMORA TRANSFORMATION

How QPRIMORA understands VRP

REAL-WORLD PROBLEM Deliver to every customer
↓
CUSTOMER ASSIGNMENT Which vehicle serves each customer?
↓
ROUTE ORDER In what order should each vehicle visit?
↓
CONSTRAINTS Every customer exactly once
↓
REPRESENTATION QUBO
↓
QPRIMORA PRIMITIVE Multi-Vehicle Combinatorial Optimization
QPRIMORA · INSIDE THE TRANSFORMATION

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.

yi,v ∈ {0,1}

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.

xi,j,v ∈ {0,1}
C · CONSTRAINTS
Each customer once
Σv yi,v = 1
Route continuity
incoming = outgoing
Start at depot
Depot → Route
Return to depot
Route → Depot
D · OBJECTIVE

Minimize the total distance travelled by all vehicles.

min Σv,i,j di,j xi,j,v
E · QUBO

Distance, customer assignment and route constraints can be encoded into one quadratic binary objective.

E(x,y) = Distance + A·AssignmentPenalty + B·RoutePenalty
VRP → Binary Variables → QUBO
F · QAOA + VIRTUAL QPU
QUBO → Cost Hamiltonian → QAOA → Virtual QPU → Measurement

The optimization path attempts to increase the measurement probability of lower-cost vehicle-routing states.

03 · COMPUTE

Run both approaches

CLASSICAL

Exact Search

Customer locations ↓ Vehicle assignment ↓ Route permutations ↓ Minimum total distance
QUANTUM PATH

Virtual QPU

QUBO ↓ Cost Hamiltonian ↓ QAOA ↓ Virtual QPU ↓ Measurement
04 · WHY VRP IS HARD

Why is VRP harder than TSP?

01 Customer assignment

First decide which vehicle serves each customer.

02 Route ordering

Then optimize the visiting order inside every vehicle route.

03 Coupled decisions

Changing one customer's vehicle can change several optimal routes.

QPRIMORA ARCHITECTURE

From logistics intent to QPU execution

Delivery problem → Representation → Primitive → Algorithm → Compiler → Virtual QPU → Real QPU

Users describe the logistics objective. QPRIMORA handles the path toward a quantum-executable representation.