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
C1CaptBOMF1BOMMIA
C22/OBOMF2DELMIAport
C3C/EDELF3MAAMIAport + rank
C43/EDELF4COKMIAport + rank
C5CookMAAF1BOMMIAport + rank
C6BosunMAAF2DELMIAport + rank
C7ABCOKF3MAAMIAport
C8OSCOKF4COKMIA
Convergence trace
Run the solver to see cost convergence.
Scales to the 5,000+ monthly flights via a hybrid quantum-classical solver.