Algorithm for Optimal Arrival and Departure Sequencing and Runway Assignment

This work proposes a framework to compute with computational efficiency, the optimal runway assignment, and sequencing of arrival and departure operations at an airport with any number, layout, and configuration of runways. The runway assignment problem is solved based on the typical demand mix of aircraft and the scheme proposed in this work computes the allocation of arrival and departure operations on each runway, which is then fed into the sequencing algorithm that determines the set of sequences on each runway that minimize the overall makespan. The proposed sequencing algorithm is based on a branch-and-bound technique that minimizes the makespan at a given airport. The lower and upper bounds of the cost of each branch for the best first search in the branch-and-bound algorithm are computed based on the minimum separation standards between arrival and departure operations set by the Federal Aviation Administration. The optimal solution is mathematically proved to lie between these bounds and the algorithm uses these bounds to efficiently find promising branches and discard all others and terminate with at least one sequence with the minimal makespan. The proposed algorithm is analyzed and validated with real traffic operations data at the Denver International Airport and the Hartsfield Jackson Atlanta International Airport.