Share these talks and lectures with your colleaguesInvite colleagues
Can we improve decision making about departure runway assignment? An application of the quadratic assignment and quadratic bottleneck assignment problem
The Quadratic Assignment Problem (QAP) and its corollary Quadratic Bottleneck Assignment Problem (QBAP) are reputed for being non-deterministic polynomial-time hard (NP-hard) problems. In aviation, they have been used to assign aircraft to gates. This paper, based on the case of Seattle/Tacoma International airport, proposes to illustrate how the QAP and QBAP models can be used to help measure the impact of runway reassignment decisions in terms of tarmac times. This study identifies the global optimal solution for the QAP as a Mixed Integer Linear Programming and the local optimal solution for the QBAP as a Mixed Integer Non-Linear Programming.
The full article is available to institutions that have subscribed to the journal
Tony Diana is the Acting Division Manager, Outreach at the US Federal Aviation Administration (FAA). He received his doctorate in policy analysis and quantitative management from the University of Maryland, Baltimore County. He is involved in the communication of progress in modernisation programmes at US airports, metroplexes and airspaces. Prior to that position, he was Division Manager, NextGen Performance in the Office of NextGen Performance and Outreach and Deputy Division Manager, Forecasting and Performance Analysis, in the Office of Aviation Policy and Plans of the FAA, where he managed the aviation system performance metrics data warehouse. At the Maryland Aviation Administration, he was involved in performance measurement and route development. Tony’s main interests are performance evaluation and benchmarking as well as the study of delay. He is a certified Lean Sigma Master Black Belt and a certified Project Management Professional.