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.


    Access

    Download


    Export, share and cite



    Title :

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


    Contributors:


    Publication date :

    2016




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    Aircraft landing sliding runway

    HE SHULIANG | European Patent Office | 2022

    Free access

    DETERMINING RUNWAY EXIT FOR LANDING AIRCRAFT

    MARCO GAERTNER / JENDRICK WESTPHAL | European Patent Office | 2021

    Free access

    Determining a runway exit for landing an aircraft

    GAERTNER MARCO / WESTPHAL JENDRICK | European Patent Office | 2021

    Free access

    DETERMINING A RUNWAY EXIT FOR LANDING AN AIRCRAFT

    GAERTNER MARCO / WESTPHAL JENDRICK | European Patent Office | 2021

    Free access

    Runway Independent Aircraft Extremely Short Takeoff and Landing

    Hall, David W. / Pasman, Renee | NTRS | 2004