This paper investigates the concept of combined arrival-departure scheduler that assigns the time of arrivals and departures at an airport with the aim of minimizing total delays. The paper presents a Mixed Integer Linear Program (MILP)-based scheduler model that calculates the optimum sequence of aircraft in arrival and departure stream at an airport constrained by minimum wake vortex separation and their estimated time of operations. Rather than treating the arrival and departure streams as two separate entities, the paper explores the concept of solving for a better solution by modeling the two streams together by introducing additional constraints. The paper compares this approach to current practice of filling arrival and departure slots in first come first serve order using San Diego International airport as a test case. The paper presents the results from the combined arrival-departure scheduler and compares them to a first-come-first-serve schedule. Next, the paper uses the scheduler to compute the effects of a "best-equipped, best-served" concept on airport delays due to changes in arrival and departure sequences.
展开▼
