A near-linear time algorithm and a min-cost flow approach for determining the optimal landing times of a fixed sequence of planes

The aircraft landing problem (ALP) is an important issue of assigning an airport’s runways to the arrival aircrafts as well as to schedule the landing time of these aircrafts in practice. A large number of the extant studies have tried to address such a practical problem with using various algorithm...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Annals of operations research Jg. 344; H. 1; S. 479 - 498
Hauptverfasser: Cao, Bin, Xu, Chao
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.01.2025
Springer Nature B.V
Schlagworte:
Aircraft
Aircraft landing
Algorithms
Business and Management
Combinatorics
Linear programming
Minimum cost
Operations Research/Decision Theory
Original - OR Modeling/Case Study
Runways
Schedules
Theory of Computation
Min-cost flow
static single-runway system
Scheduling
Polynomial-time algorithm
Aircraft landing problem
ISSN:0254-5330, 1572-9338
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The aircraft landing problem (ALP) is an important issue of assigning an airport’s runways to the arrival aircrafts as well as to schedule the landing time of these aircrafts in practice. A large number of the extant studies have tried to address such a practical problem with using various algorithms for one or more runways. For a static single-runway of the ALP, this paper proposes a new approach to develop an alternative powerful algorithm. For a given sequence of planes, we develop a faster algorithm for solving the ALP with the running time O ( n log n ) , where n is the number of aircrafts in the schedule. Alternatively, we reduce the proposed problem of minimizing the total cost by determining the landing times for a given landing sequence into a min-cost flow problem. We conduct a set of experimental studies to compare the performance of our near-linear time algorithm to the quadratic time algorithm whose time complexity is O ( n 2 ) , for computing the optimal landing times. The computational results show that the proposed heuristic based on our algorithm could be much faster than both such quadratic time algorithm and the one using linear programming.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-024-06358-x