QAOA solves simplified, cost-weighted tail-assignment instances with up to 14 routes in simulation, but its time-to-solution grows faster than classical branch-and-price.
This is illustrated in Figure 3, where the INTERP strat- egy was applied to an instance of 6 routes and a low average valency of 0.66 in the route graph
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem
QAOA solves simplified, cost-weighted tail-assignment instances with up to 14 routes in simulation, but its time-to-solution grows faster than classical branch-and-price.