Can we improve decision making about departure runway assignment? An application of the quadratic assignment and quadratic bottleneck assignment problem

Tony Diana
Additional contact information
Tony Diana: Manager of the Outreach Division at Federal Aviation Administration, NextGen Collaboration and Messaging Office, USA

Journal of Airport Management, 2017, vol. 11, issue 3, 258-270

Abstract: 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.

Keywords: quadratic assignment problem; quadratic bottleneck assignment problem; mixed integer linear programming; mixed integer non-linear programming; runway assignment (search for similar items in EconPapers)
JEL-codes: M1 M10 R4 R40 (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
https://hstalks.com/article/4430/download/ (application/pdf)
https://hstalks.com/article/4430/ (text/html)
Requires a paid subscription for full access.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:aza:jam000:y:2017:v:11:i:3:p:258-270

Access Statistics for this article

More articles in Journal of Airport Management from Henry Stewart Publications
Bibliographic data for series maintained by Henry Stewart Talks ().