Evolutionary approaches are not usually considered for real time scheduling problems due to long computation times and uncertainty about the length of the computation time. The authors argue that for some kinds of problems, such as optimizing aircraft landing times, genetic algorithms have advantages over other methods as a best solution is always available when needed, and, since the computation is inherently parallel, more processors can be added to get higher quality solutions if necessary. Furthermore, the computation time can be decreased and the quality of the generated schedules increased by seeding the genetic algorithm from a previous population. They have performed a series of experiments on landing data for Sydney airport on the busiest day of the year. Their results show that high quality solutions can be computed in the time window between aircraft landings.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Real time genetic scheduling of aircraft landing times


    Contributors:
    Ciesielski, V. (author) / Scerri, P. (author)


    Publication date :

    1998


    Size :

    5 Seiten, 10 Quellen




    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English




    Mobile Aircraft Landing Stair Scheduling

    Liu, Ming / Liu, Zhongzheng | IEEE | 2019


    Dual-track flight landing real-time scheduling method

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

    Free access

    Real-time adaptive aircraft scheduling

    Kolitz, Stephan E. / Terrab, Mostafa | NTRS | 1990


    Real-time radar signal processing for autonomous aircraft landing

    Sadjadi, Firooz A. / Helgeson, Michael A. / Radke, Jeffrey D. et al. | SPIE | 1993


    A heuristic algorithm for aircraft landing scheduling problem

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