HighlightsAn effective artificial bee colony algorithm for robust ASSP model is proposed.Parallel runway operation with delays intervals has been considered.Min max regret approach in ASSP model considered a set of possible scenarios.The model is able to solve an hour traffic scenario with less than 5min.The performance of proposed algorithms outperforms other meta-heuristics.

    AbstractThis study considers the aircraft sequencing and scheduling problem under the uncertainty of arrival and departure delays for multiple heterogeneous mixed-mode parallel runways. To enhance runway resilience, runway operations should remain robust to mitigate the effects of delay propagation. The main objective of this research was to identify an optimal schedule by evaluating the robustness of feasible solutions under its respective worst-case scenario. A novel artificial bee colony algorithm was developed and verified by experimental results. The proposed efficient artificial bee colony algorithm can obtain close-to-optimal results with less computational effort in regard to a one-hour flight traffic planning horizon.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Robust aircraft sequencing and scheduling problem with arrival/departure delay using the min-max regret approach


    Contributors:
    Ng, K.K.H. (author) / Lee, C.K.M. (author) / Chan, Felix T.S. (author) / Qin, Yichen (author)


    Publication date :

    2017-08-08


    Size :

    22 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English