Quantum-Inspired Optimization

Crew → flight assignment. Annealing the combinatorial blob.

A toy version of the 5,000+ flights/month problem. Objective = fare + rank-fit penalty + mis-routing penalty. Simulated annealing approximates the quantum-annealing step used in production.

Naive baseline
$14,900
round-robin assignment
Annealed best
—
run the solver
Penalty hits
—
rank or routing mismatches
Assignment matrix
CrewRankHome PortFlightRouteOK
C1CaptBOMF1BOM → MIA✓
C22/OBOMF2DEL → MIAport
C3C/EDELF3MAA → MIAport + rank
C43/EDELF4COK → MIAport + rank
C5CookMAAF1BOM → MIAport + rank
C6BosunMAAF2DEL → MIAport + rank
C7ABCOKF3MAA → MIAport
C8OSCOKF4COK → MIA✓
Convergence trace
Run the solver to see cost convergence.
Scales to the 5,000+ monthly flights via a hybrid quantum-classical solver.