Multiple-runway aircraft sequencing problems using mixed-integer programming

Abstract

We examine aircraft sequencing problems over multiple runways, under mixed mode operations, with the objective of minimizing the total weighted tardiness of aircraft landings and departures. A mixed-integer programming formulation that exploits the underlying multiple asymmetric traveling salesman structure is proposed and enhanced using valid inequalities and symmetry-defeating hierarchical constraints. Exact solutions are reported using simulated data sets to demonstrate the efficacy of the developed formulation and the proposed enhancements.