Advanced Search
MyIDEAS: Login

Disruption Management for Commercial Aviation

Contents:

Author Info

Registered author(s):

    Abstract

    Airlines are constantly facing operational disruptions such as reduced airport capacity because of bad weather or strikes, unexpected aircraft unavailability due to mechanical failures, and delayed or cancelled flights. In view of this, ROADEF organized a worldwide challenge to explore the problems encountered in real world airlines when disruptions happen and find approaches to tackle them. In this paper, a new continuous time aircraft routing model is developed which can minimize aircraft delay cost accurately and efficiently handle all types of disruptions encountered in ROADEF. Applying a new decomposition algorithm, near optimal solutions for aircraft routing can be obtained. A passenger re-accommodation model is solved subsequently using the results from the aircraft routing model as input. Competitive results are obtained applying the proposed approach to instances provided by ROADEF.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.iuj.ac.jp/workingpapers/index.cfm?File=EMS_2012_18.pdf
    File Function: First version, 2012
    Download Restriction: no

    Bibliographic Info

    Paper provided by Research Institute, International University of Japan in its series Working Papers with number EMS_2012_18.

    as in new window
    Length: 35 pages
    Date of creation: Nov 2012
    Date of revision:
    Handle: RePEc:iuj:wpaper:ems_2012_18

    Contact details of provider:
    Postal: 777 Kokusai-cho, Minami Uonuma0-shi, Niigata 949-7277 JAPAN
    Phone: 81+(0)25-779-1112
    Fax: 81+(0)25-779-1187
    Web page: http://www.iuj.ac.jp/research/
    More information through EDIRC

    Related research

    Keywords: Disruption Management; ROADEF Challenge 2009; Airline;

    This paper has been announced in the following NEP Reports:

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Thengvall, Benjamin G. & Yu, Gang & Bard, Jonathan F., 2001. "Multiple fleet aircraft schedule recovery following hub closures," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(4), pages 289-308, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:iuj:wpaper:ems_2012_18. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Kazumi Imai, Office of Academic Affairs).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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