We address the problem of determining the arrival sequencing and scheduling for aircrafts in air traffic control system. The overall objective of this problem is the minimization of delay cost. The problem is NP-hard for this reason solving the problem optimally is limited to instances of small sizes. In this paper we treat the static case of ASS problem where all data are known in advance. We begin by proposed a mathematical quadratic integer model, with the constraint of limited time window. After we propose a change of variable in order to make linear the initial quadratic constraints. The second target of this work is to resolve the model by an ant colony algorithm. Numerical simulations are applied to real data to show the effectiveness of our new formulation and our approach. They are presented at the end of this article.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Ant Colony Optimization for aircraft landings


    Contributors:
    Farah, I. (author) / Kansou, A. (author) / Yassine, A. (author) / Galinho, T. (author)


    Publication date :

    2011-05-01


    Size :

    1251476 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Simulating aircraft landings in fog

    Sparke, J.W. / Ringe, H.F. | Engineering Index Backfile | 1950


    Algorithms for Scheduling Aircraft Landings

    Ernst, A. T. / Krishnamoorthy, M. / International Federation of Operational Research Societies | British Library Conference Proceedings | 2001


    Scheduling Aircraft Landings - The Static Case

    Beasley, J.E. | Online Contents | 2000


    Scheduling Aircraft Landings-The Static Case

    Beasley, J. E. / Krishnamoorthy, M. / Sharaiha, Y. M. et al. | British Library Online Contents | 2000