Flight landing optimization at the terminal area is an ongoing challenge for air traffic controllers. The current schedule scheme is first-come-first-served (FCFS). There are studies focusing on how to minimize the total cost or maximize the throughput. These schemes are short of fairness consideration. In this paper, we start from a real recent example to show that a lack of consideration of long-term fairness may cause significant problems in certain emergency situations. We propose new definitions of fairness between different airlines which consider the history fairness information. We then study the fairness in flight landing problem (FFLP). We show that the problem is NP-hard to solve. Therefore, we develop a fast heuristic. Our experiment results show that our algorithm achieves a 50.4% gain on long-term fairness.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Revisit the fairness issues in flight landing scheduling


    Contributors:
    Wang, Yong (author) / Wang, Feng (author) / Wang, Dan (author) / Gong, Zhenghu (author) / Liu, Jiangchuan (author)


    Publication date :

    2012-09-01


    Size :

    214404 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Dual-track flight landing real-time scheduling method

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

    Free access

    Flight landing scheduling method based on improved DQN algorithm

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

    Free access

    FLIGHT BODY LANDING PORT, AND FLIGHT BODY LANDING METHOD

    OKIHARA JUN / TANIGAWA HIROAKI / OKUBO NORIHIRO | European Patent Office | 2020

    Free access


    PACKET TRANSMISSION SCHEDULING FAIRNESS

    LIVNE SARIG / ELATI NOAM / KRISHNAN HEMANTH et al. | European Patent Office | 2022

    Free access