On the Optimality Gap of Full Airport Slot Assignments: Capacity-Limited Packing with Pareto Optimality Constraints

Andreas Brieden, Peter Gritzmann, Michael Ritter

Publikation: Beitrag in Buch/Bericht/KonferenzbandKapitelBegutachtung

Abstract

We study a combinatorial packing problem with Pareto optimality constraints which arises naturally in the aviation industry. In fact, it has been observed that the current practice of assigning takeoff and landing rights at major airports may result in a significant gap between full and maximal flight schedules in practice. We analyze the specific packing problem theoretically and, particularly, study the occurring optimality gap under the prevailing regulatory regimes at the major airports in Germany. Finally, we report on the findings of a computational study based on real-world flight requests for one highly congested German airport.

OriginalspracheEnglisch
TitelAIRO Springer Series
Herausgeber (Verlag)Springer Nature
Seiten187-199
Seitenumfang13
DOIs
PublikationsstatusVeröffentlicht - 2024

Publikationsreihe

NameAIRO Springer Series
Band13
ISSN (Print)2523-7047
ISSN (elektronisch)2523-7055

Fingerprint

Untersuchen Sie die Forschungsthemen von „On the Optimality Gap of Full Airport Slot Assignments: Capacity-Limited Packing with Pareto Optimality Constraints“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren