Back to Search
Start Over
Arrival and Departure Sequencing, Considering Runway Assignment Preferences and Crossings
- Source :
- Aerospace, Vol 11, Iss 8, p 604 (2024)
- Publication Year :
- 2024
- Publisher :
- MDPI AG, 2024.
-
Abstract
- Aircraft sequencing has the potential to decrease flight delays and improve operational efficiency at airports. This paper presents the aircraft sequencing problem (ASP) on multiple runways with complex interactions by allocating flights on runways and optimizing landing times, take-off times, and crossing times simultaneously in a uniform framework. The problem was formulated as a mixed-integer program considering realistic operational constraints, including runway assignment preferences based on the entry/exit fixes of the terminal maneuvering area (TMA), minimum runway separation, time window, and arrival crossing rules. Variable-fixing strategies were applied, to strengthen the formulation. A first-come-first-served (FCFS) heuristic was proposed for comparison. Various instances from the literature and from realistic data sets were tested. Our computational study showed that the solution approach optimizes runway schedules, to achieve significantly fewer flight delays, taking runway assignment preferences and arrival crossings into account.
Details
- Language :
- English
- ISSN :
- 11080604 and 22264310
- Volume :
- 11
- Issue :
- 8
- Database :
- Directory of Open Access Journals
- Journal :
- Aerospace
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.fe8132b9b35640dfae2b6231b6fa0e69
- Document Type :
- article
- Full Text :
- https://doi.org/10.3390/aerospace11080604