By Topic

Using Ant Colony Optimization Algorithm to Solve Airline Crew Scheduling Problems

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
$33 $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)
Chih-Chung Lo ; Fo Guang University, Taiwan ; Guang-Feng Deng

In this paper, an ant colony optimization (ACO) based ant crew scheduling model (ACSM) is proposed to solve airline crew scheduling problems. In the proposed ACSM, airline crew scheduling problems are first formulated as traveling salesman problems with flight graph representation. Then, the ACO algorithm is applied to search near-optimal solutions for airline crew schedules. The validity of the proposed ACSM is verified by implementing it in real study cases. The results from the implementation and evaluation confirm that the proposed ACSM is suitable for the airline crew scheduling problems with good performance.

Published in:

Third International Conference on Natural Computation (ICNC 2007)  (Volume:4 )

Date of Conference:

24-27 Aug. 2007