An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems
We improve the tractability of multiple-runway aircraft sequencing problems. First effective branch-and-price algorithm reported for this problem. Solving elementary shortest path problem with non-triangular separation times. Subproblem solved using specialized, effective dynamic programming procedure. Optimal solutions in far better CPU times (vs. CPLEX) on challenging instances.
branch-and-price aircraft sequencing elementary shortest path problems dynamic programming column generation