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.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01642746
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jul 24 2017 10:19AM