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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Meta-Heuristic Algorithms for Aircraft Sequencing and Scheduling Problem


    Additional title:

    Sustainable aviat.




    Publication date :

    2022-11-26


    Size :

    12 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    A heuristic algorithm for aircraft landing scheduling problem

    Guliashki, Vassil / Music, Gasper / Marinova, Galia | IEEE | 2023


    An Effective Meta-Heuristic Technique for Solving Train Scheduling Problem

    Khan, M.B. / Fan, W. / Zhang, D. et al. | British Library Conference Proceedings | 2007


    An Effective Meta-Heuristic Technique for Solving Train Scheduling Problem

    Khan, M. B. / Fan, Wangbo / Zhang, Dianye | ASCE | 2007



    Exact and Heuristic Algorithms for Runway Scheduling

    Malik, Waqar A. / Jung, Yoon C. | NTRS | 2016