IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v270y2018i3p1148-1157.html
   My bibliography  Save this article

A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes

Author

Listed:
  • Faye, Alain

Abstract

This paper considers the Aircraft Landing Problem. The aim is to schedule arriving aircraft at the airport under the condition of safe landing. Landing times lie within predefined time windows and safety separation constraints between two successive aircraft landing on the same runway, must be satisfied. The objective is to minimize the total cost of landing deviation from predefined target times within the time windows. On each runway, for a fixed landing sequence, the problem can be solved by a linear program. When safety separation times satisfy the Triangle Inequality, we propose an O(n2) algorithm for solving the problem where n is the number of planes of the sequence. We compare the performance of this polynomial time algorithm to the linear programming method. The two methods are embedded in an iterative algorithm, based on simulated annealing, for solving the single runway case. Computational tests, performed on publicly available problems, show that the heuristic based on our algorithm is much faster than the one using linear programming. This gain in CPU time allows to obtain better solutions in a fixed amount of time.

Suggested Citation

  • Faye, Alain, 2018. "A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes," European Journal of Operational Research, Elsevier, vol. 270(3), pages 1148-1157.
    • Handle: RePEc:eee:ejores:v:270:y:2018:i:3:p:1148-1157
    DOI: 10.1016/j.ejor.2018.04.021
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718303242
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2018.04.021?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ahmed Khassiba & Fabian Bastin & Sonia Cafieri & Bernard Gendron & Marcel Mongeau, 2020. "Two-Stage Stochastic Mixed-Integer Programming with Chance Constraints for Extended Aircraft Arrival Management," Transportation Science, INFORMS, vol. 54(4), pages 897-919, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:270:y:2018:i:3:p:1148-1157. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.