Aircraft sequencing and scheduling are significant operations for air traffic controllers and pilots. This study presents a mixed-integer linear programming model to minimize the average delay per aircraft for the single and mixed operations runway. Due to the complexity of the problem, the genetic algorithm, tabu search, and simulated annealing algorithms were applied to solve this problem. In addition, the results of the three different meta-heuristic algorithms were compared with the first-come first-served approach and each other. The results demonstrated that all algorithms could noticeably decrease the average delay per aircraft compared to the first-come first-served approach.
Meta-Heuristic Algorithms for Aircraft Sequencing and Scheduling Problem
Sustainable aviat.
26.11.2022
12 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
An Effective Meta-Heuristic Technique for Solving Train Scheduling Problem
British Library Conference Proceedings | 2007
|Exact and Heuristic Algorithms for Runway Scheduling
NTRS | 2016
|