IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v38y2021i05ns021759592140025x.html
   My bibliography  Save this article

A Novel Rescheduling Algorithm for the Airline Recovery with Flight Priorities and Airport Capacity Constraints

Author

Listed:
  • Chenlu Ji

    (Data Science Institute, Shandong University, Jinan 250100, P. R. China)

  • Mingang Gao

    (Institutes of Science and Development, Chinese Academy of Sciences, Beijing 100190, P. R. China)

  • Xu Zhang

    (Data Science Institute, Shandong University, Jinan 250100, P. R. China)

  • Jiaxuan Li

    (School of Mathematics, Shandong University, Jinan 250100, P. R. China)

Abstract

Many flights experience delays at the airport due to bad weather, temporary closures of airports, unscheduled maintenance, etc., which emphasizes the urgent need for disruption management. It is widely accepted for Chinese airline companies to determine the flight timetable according to the lexicographic preference of flight priorities. Flight schedulers usually deal with the preceding flights as important as the latter flight of a higher priority. In this paper, we propose a build-in flight feasibility verification algorithm to improve the rescheduling algorithm. A novel model of the feasibility verification problem is given, which is equivalent to the model of a maximum clique problem for networks. Examples and tests show the advantage of our algorithm, and the algorithm runs fairly quickly and can be plugged in other scheduling algorithms easily.

Suggested Citation

  • Chenlu Ji & Mingang Gao & Xu Zhang & Jiaxuan Li, 2021. "A Novel Rescheduling Algorithm for the Airline Recovery with Flight Priorities and Airport Capacity Constraints," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 38(05), pages 1-24, October.
    • Handle: RePEc:wsi:apjorx:v:38:y:2021:i:05:n:s021759592140025x
    DOI: 10.1142/S021759592140025X
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S021759592140025X
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S021759592140025X?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.

    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:wsi:apjorx:v:38:y:2021:i:05:n:s021759592140025x. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.