Fleet assignment with a continuously adjustable flight schedule

Ta-Chung Wang, Ching Mei Li

研究成果: Article同行評審

摘要

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.

原文English
頁(從 - 到)323-343
頁數21
期刊Transportation Journal
52
發行號3
DOIs
出版狀態Published - 2013 六月 1

All Science Journal Classification (ASJC) codes

  • 運輸

指紋

深入研究「Fleet assignment with a continuously adjustable flight schedule」主題。共同形成了獨特的指紋。

引用此