A Model for Fleet Assignment in the City-Pair Route Network

Author

Yan, Ke-wu

Author_Institution

Sch. of Econ. & Manage., Jiangsu Teachers Univ. of Technol., Changzhou

fYear

2008

fDate

30-31 Dec. 2008

Firstpage

543

Lastpage

545

Abstract

The fleet assignment is an important factor affecting the airline´s operation costs. Given a flight schedule, which consisted of a set of flights with specified departure and arrival time, a set of aircraft types and a set of restrictions, the airline fleet assignment problem (FAP) is to determined which aircraft type should fly each flight leg. Based on the analysis of the real operation circumstance and the technical parameter of different kinds of aircraft types, a mathematical model for the city-pair network and the corresponding solution are offered in this paper. It is practical for an airline which operates between two branch airports.

Keywords

cost reduction; telecommunication network management; telecommunication network routing; traffic information systems; travel industry; aircraft; city-pair route network; fleet assignment problem; flight schedule; Aircraft; Airplanes; Airports; Cities and towns; Conference management; Costs; Economic forecasting; Information technology; Mathematical model; Symmetric matrices; City-pair Route Network; Fleet assignment; Mathematical model; Traffic management;

fLanguage

English

Publisher

ieee

Conference_Titel

MultiMedia and Information Technology, 2008. MMIT '08. International Conference on

Conference_Location

Three Gorges

Print_ISBN

978-0-7695-3556-2

Type

conf

DOI

10.1109/MMIT.2008.99

Filename

5089180