Solving a leg-based cabin crew scheduling problem by genetic algorithm

Wen Na Ma*, Po Ting Lan, Dah Chuan Gong

*Corresponding author for this work

Research output: Contribution to conferenceConference Paperpeer-review

Abstract

The efficient operation and profitability of an airline is adherence to its crew schedule. To upgrade the accuracy of the cabin crew scheduling and to maximize the crew utilization, we present a new solution model that integrates the crew pairing problem and the crew rostering problem into one stage, and conduct the scheduling by leg, which is a smaller scheduling unit than pairing, and search for the global optimal solution. A case study regarding the operation of a major Taiwan airline is illustrated. Referring to the objectives and constraints of airline industry in Taiwan, we properly obtain the levels of parameters via the design of experiment and apply the genetic algorithm to solve the problems of cabin crew planning and rostering. Finally, comparison of the genetic algorithm result with a branch and bound algorithm for the problem, demonstrates that the genetic algorithm obtains a near optimal solution.

Original languageEnglish
Pages1443-1455
Number of pages13
StatePublished - 2006
Externally publishedYes
Event36th International Conference on Computers and Industrial Engineering, ICC and IE 2006 - Taipei, Taiwan
Duration: 20 06 200623 06 2006

Conference

Conference36th International Conference on Computers and Industrial Engineering, ICC and IE 2006
Country/TerritoryTaiwan
CityTaipei
Period20/06/0623/06/06

Keywords

  • Cabin crew rostering problem
  • Cabin crew scheduling
  • Genetic algorithm
  • Leg-based cabin crew rostering

Fingerprint

Dive into the research topics of 'Solving a leg-based cabin crew scheduling problem by genetic algorithm'. Together they form a unique fingerprint.

Cite this