碩士 / 國立交通大學 / 運輸科技與管理學系 / 90 / Generally, the airline crew scheduling problem can be separated into two sub-problems of lower difficulty. One is “crew pairing problem” and the other is “crew rostering problem”. For the crew pairing problem, the object is to minimize the cost and construct an efficient set of pairings; for the crew rostering problem, it must consider the satisfaction of crew members. Both of them have to obey the flight schedules、flight regulations、operation restrictions and union rules. Nowadays, some airlines put more emphasis on equitability. So in order to increase the satisfactions of the crews, it’s an important issue to assign even workload to crew members. The feature of this research is that we generate the cabin crews’ schedules for the purpose of equitable rostering.
The cabin crew rostering problem is a complicated MP problem. This research formulates it as a set partition problem and constructs a heuristic method to solve the problem in three phases. The first phase is long-haul pairing allocation. In this phase, we assign all pairings each with flight-day greater than two. The second is 2-day short-haul pairing allocation. In this phase, we assign the pairings each with flight-day equal to two. The third is 1-day short-haul pairing allocation. In this phase, we present a unique heuristic method to assign the pairings each with flight-day equal to one (including stand-by duties). In each phase, the objective is to minimize equitable crew rostering cost under all the restrictions and laws. The heuristic program is written in C language, and the CPLEX 7.0 is used as the MP solver.
With a case study of 169 pursers and 1274 pairings of a Taiwan’s major airline, the results show that the total equitable cost decreases 25% comparing to the original equitable cost of the airline. The Block Hour in our roster is less than the airline’s maximal BH, so it won’t increase the airline’s real cost. It also proves that the new methods we propose can not only decrease the complexity and variables of the problem, but also construct new equitable and good quality rosters.
| Identifer | oai:union.ndltd.org:TW/090NCTU0423002 |
| Date | January 2002 |
| Creators | Li-Hsin Chen, 陳立欣 |
| Contributors | Anthony F. W. Han, 韓復華 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | zh-TW |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 0 |
Page generated in 0.0021 seconds