A WORKLOAD-BALANCE CROSSOVER OPERATION IN A GENETIC ALGORITHM FOR SOLVING AN AIRLINE CREW ROSTERING PROBLEM
The Airline Crew Scheduling Problem (ACSP) a large-scaled and complex optimization problem that assigns crew members to the flight duties while satisfying agreements with the labour union and other requirements.The ACSP is divided into two stages;Crew Pairing Problem which consists on finding a sequences of flights, starting and ending at a crew base, and Crew Rostering Problem which assigns the pairings to individual crew member.The nominal Crew Rostering Problem considers operations costs are minimized.This paper proposed the bi-criterion mathematical formulation for Crew Rostering Problem which takes the crew satisfaction as the main concern.A genetic algorithms technique is proposed to produce balanced per-diem and workload solutions with acceptable deviation for the crew staff.The proposed approach is evaluated on a data from Thai Airways.
Multi-Criterion Optimization Heuristics Genetic Algorithms Airlines Operations Crew Scheduling Crew Rostering
Chawalit Jeenanunta Boonyarit Intiyot Kotchaporn Onsuan
School of Management Technology, Sirindhorn International Institute of Technology, Thammasat Univers Department of Mathematics and Computer Science, Faculty of Science, Chulalongkorn University,Bangkok
国际会议
The 11th International Conference on Industrial Management(第十一届工业管理国际会议)
日本
英文
164-170
2012-08-29(万方平台首次上网日期,不代表论文的发表时间)