The aircraft landing problem (ALP) consists of scheduling the landing of aircrafts onto the available runways in an airport by assigning to each aircraft a landing time and a specific runway while respecting different operational constraints. This is a complex task for the air traffic controller, especially when the flow of aircrafts entering the radar range is continuous and the number of aircrafts is unknown a priori. In this paper, we study the dynamic version of the ALP when new aircrafts appear over time, which means that the landing of the previous aircrafts should be rescheduled. To solve this problem, we propose a memetic algorithm combining an ant colony algorithm and a local heuristic.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    A memetic algorithm to solve the dynamic multiple runway aircraft landing problem


    Beteiligte:


    Erscheinungsdatum :

    2016




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt




    Aircraft landing sliding runway

    HE SHULIANG | Europäisches Patentamt | 2022

    Freier Zugriff

    DETERMINING RUNWAY EXIT FOR LANDING AIRCRAFT

    MARCO GAERTNER / JENDRICK WESTPHAL | Europäisches Patentamt | 2021

    Freier Zugriff

    DETERMINING A RUNWAY EXIT FOR LANDING AN AIRCRAFT

    GAERTNER MARCO / WESTPHAL JENDRICK | Europäisches Patentamt | 2021

    Freier Zugriff

    Cellular automation for double-runway aircraft landing scheduling

    Shuo Zhao / Jing Fang / Xiaopeng Ji | IEEE | 2014


    Determining a runway exit for landing an aircraft

    GAERTNER MARCO / WESTPHAL JENDRICK | Europäisches Patentamt | 2021

    Freier Zugriff