By Topic

Application of Simulated Annealing Algorithm in Airline Fleet Assignment Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yu Wang ; Air-Transp. Manage. Sch., Civil Aviation Flight Univ. of China, Guanghan, China ; Hong Sun

Airline fleet assignment problem, which means assigning right aircraft types to proper flights to make airlines' profit maximum, is an important part in airline production schedule and organization. Though analyzing the characteristic of chinese single hub and spoke network, we compose flight pairings by connecting the time and space associated flights. Then, according to the departure and complete time of flight pairings, the time sequence network is constructed, in which the fleet assignment is transfered to the network flow model. Finally, the direct path decomposition is used to design simulated annealing algorithm for fleet assignment. The simulations indicate the proposed algorithm's average CPU time is 04.18 seconds and the total assigning profit is stable for the scale of 40 flight parings daily, 7 airplane types and 22 airplanes. The result shows this idea is effective.

Published in:

Intelligent System Design and Engineering Application (ISDEA), 2010 International Conference on  (Volume:1 )

Date of Conference:

13-14 Oct. 2010