IDEAS home Printed from https://ideas.repec.org/a/wly/transj/v52y2013i3p323-343.html
   My bibliography  Save this article

Fleet Assignment with a Continuously Adjustable Flight Schedule

Author

Listed:
  • Ta‐Chung Wang
  • Ching‐Mei Li

Abstract

Fleet assignment is one of the four major steps in airline planning. The objective of the fleet assignment problem (FAP) is to determine which type of aircraft should fly on each flight leg while considering different characteristics and costs associated with different fleet types. This article proposes a multiphase approach to solving the FAP. Backward arcs were used to solve basic FAPs. Then the backward arcs were eliminated by using linear programming. By allowing backward time, our formulation has a similar level of flexibility as the fleet assignment model with time‐window (FAMTW), but the problem size grows much slower than FAMTW. Examples using real data obtained from a major airline are included in this article.

Suggested Citation

  • Ta‐Chung Wang & Ching‐Mei Li, 2013. "Fleet Assignment with a Continuously Adjustable Flight Schedule," Transportation Journal, John Wiley & Sons, vol. 52(3), pages 323-343, July.
    • Handle: RePEc:wly:transj:v:52:y:2013:i:3:p:323-343
    DOI: 10.5325/transportationj.52.3.0323
    as

    Download full text from publisher

    File URL: https://doi.org/10.5325/transportationj.52.3.0323
    Download Restriction: no
    File URL: https://libkey.io/10.5325/transportationj.52.3.0323?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:wly:transj:v:52:y:2013:i:3:p:323-343. 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: Wiley Content Delivery (email available below). General contact details of provider: .

    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.