Fleet Assignment with a Continuously Adjustable Flight Schedule

Ta‐Chung Wang and Ching‐Mei Li

Transportation Journal, 2013, vol. 52, issue 3, 323-343

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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.5325/transportationj.52.3.0323

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:transj:v:52:y:2013:i:3:p:323-343

Access Statistics for this article

More articles in Transportation Journal from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().