Flights landing scheduling problem is an NP-hard problem, the article presents an Ant colony optimization algorithm based on dynamic calculation of the heuristic information to solve a single runway flights landing scheduling problem. The algorithm has better global search ability and relatively fast convergence rate. The experimental results show that compared with traditional first come first serve, genetic algorithm and particle swarm algorithm, this method can quickly give the better flight approach and landing order to help controllers make efficient aircraft scheduling policy and reduce flight delays. Keywords:Heuristic Information entropy Ant colony optimization Global search


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The Application of Ant Colony Optimization Algorithm in the Flight Landing Scheduling Problem



    Published in:

    Applied Mechanics and Materials ; 411-414 ; 2698-2703


    Publication date :

    2013-09-03


    Size :

    6 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Flight landing scheduling method based on improved DQN algorithm

    LI HUI / LU RUIXUAN / WANG ZHUANG et al. | European Patent Office | 2020

    Free access

    A heuristic algorithm for aircraft landing scheduling problem

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


    Emission and Flight Time Optimization Model for Aircraft Landing Problem

    Kursat Cecen, Ramazan / Saraç, Tugba / Cetek, Cem | Transportation Research Record | 2022



    Dual-track flight landing real-time scheduling method

    DU WENBO / CAO XIANBIN / ZHAO SHUO et al. | European Patent Office | 2015

    Free access