Fleet assignment with a continuously adjustable flight schedule

Ta-Chung Wang, Ching Mei Li

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)323-343
Number of pages21
JournalTransportation Journal
Issue number3
Publication statusPublished - 2013 Jun 1

All Science Journal Classification (ASJC) codes

  • Transportation


Dive into the research topics of 'Fleet assignment with a continuously adjustable flight schedule'. Together they form a unique fingerprint.

Cite this