| We address the problem of sequencing a set of aircraft operations (landings/departures) over multiple, mixed mode runways at congested airports. The problem, classically formulated as a mixed-integer program, is reformulated as a set partitioning model that is solved using a branch-and-price approach. In particular, a dynamic programming scheme that is embedded in the column generation approach is shown to significantly contribute to the numerical efficacy of this solution technique. Computational results are contrasted for different optimization approaches for this class of problems. |
Updated 03/19/2014