Korean Management Science Review (경영과학)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Cockpit Crew Scheduling using Set Partitioning Problem

집합분할모형을 이용한 운항승무원의 승무경로 일정계획

  • 김국연 (공군 항공사업단 방공관제사업처) ;
  • 이영훈 (연세대학교 컴퓨터산업공학부)
  • Published : 2004.05.01
Download PDF
⟨ Previous Next ⟩

Abstract

Efficient crew scheduling for cockpit crew is important in airline industry due to operational safety and cost associated with the flight duty time. Because of complexity of regulations imposed to the cockpit crew. it is complicated to generate an efficient schedule. Schedule of cockpit crew can be generated through two steps; selecting of flight patterns. and scheduling of them to the specific time horizon. Heuristic method is developed and applied with massive data in a limited time of computation. A set of flight patterns is selected from all possible flight patterns. which are generated by composing the flight leg based on regulations. by using the set partitioning problem with objective function of oversea stay cost. The selected set of flight patterns found at the first step is allocated to 4 week crew schedule to minimize the variance of total fight time assigned to each crew. The crew schedules obtained are evaluated and compared with the ones currently used in one of major airline company.

Keywords

References

  1. 김명호, '승무원 일정계획의 개선에 관한 연구' 성균관대학교, 박사학위논문, 1996
  2. 우형동, '정수계획법에 의한 항공운항승무계획의 최적화에 관한 연구' 인하대학교 석사학위논문, 1993
  3. 장병만, '복수모기지의 항공기 운항계획 및 승무계획문제의 발견적 기법', 서울대학교 석사학위논문, 1985
  4. 전지훈, '항공기 승무원 할당 모형에 관한 연구' 국방대학교 석사학위논문, 1998
  5. Anbil, R., E. Gelman, B. Patty and R. Tanga, 'Recent advances in crew-pairing optimization at American airlines,' Interfaces, Vol.21 (1991), pp.62-74
  6. Anbil, R, C. Barnhart, L. Hatay, E.L. Johnson, and V.S. Ramakrishnan, 'Crewpairing optimization at American Airlines decision technologies,' Optimization in Industry, Eds. by T.A. Ciriani, and RC. Leachman, John Wiley and Sons Ltd. 1993, pp.31-36
  7. Abramson, D., H. Dang and M. Krishnamoorthy, 'A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm,' Annals of Operations Research, Vol.63 (1996), pp.129-150
  8. Barnhart, C., L. Hatay, and E. Johnson, 'Deadhead selection for the long-haul crew pairing problem,' Operations Research, Vol.43 (1995), pp.491-499
  9. Beasley, J.E. and B. Cao, 'A tree search algorithm for the crew scheduling problem,' European Journal of Operational Research, Vol.94 (1996), pp.517-526
  10. Beasley, J.E. and B. Cao, 'A Dynamic programming based algorithm for the crew scheduling problem,' Computer & Operations Research, Vol.25, No.7-8(1998), pp.567-582 https://doi.org/10.1016/S0305-0548(98)00019-7
  11. Chu, HD., E. Gelman and E.L. Johnson, 'Solving large scale crew scheduling problems,' European Journal of Orational Research, Vol.97 (1997), pp.260-268
  12. Cook, T.M., 'SABRE Soars,' ORMS Today, Vol.25, No.3 (1998), pp.26-31
  13. Crainic, T.G. and J. Rousseau, 'The column generation principle and airline crew scheduling problems,' INFOR, Vol.25 (1987), pp.136-151
  14. Dawid, H., J Konig, and C. Strauss, 'An enhanced rostering model for airline crews', Computer & Operations Research., Vol.28 (2001), pp.671-688
  15. Desaulniers, G., J. Desrosiers, Y. Dumas, S. Marc, B. Rioux, M.M. Solomon, and F. Soumis, 'Crew pairing at Air France', European Journal cf Operational Research, Vol.97 (1997), pp.245-259
  16. Gamache, M. and Soumis, F., 'A method for optimally solvingthe rostering problem', Cahier GERAD, G-90-40, Ecole des Hautes Etutes Hautes Etudes Commerciales, Montreal, Canada, H3T 1V6, 1993
  17. Gerbracht, R., 'A new algorithm for very large crew pairing problems,' In: 18th AGIFORS Symposium, Vancouver, Canada, 1978, pp.315-341
  18. Lagerholm, M., C. Peterson, and B. Soderberg, 'Airline crew scheduling using Potts mean field techniques,' European Journal of Operational Research, Vol.120 (2000), pp. 81-96
  19. Lavoie, S., M. Minoux and E. Odier, 'A new approach for crew pairing problem by column generation with an application to air transportation,' European Journal of Operational Research, Vol.35 (1988), pp. 45-58
  20. Levine, D, 'Application of a hybrid genetic algorithm to airline crew scheduling,' Computer and Operations Research, Vol.23, No.6 (1996), pp.547-558 https://doi.org/10.1016/0305-0548(95)00060-7
  21. Rubin, J., 'A technique for the solution of massive set covering problems, with application to air crew scheduling,' Transportation Science, Vol.7 (1973), pp.34-48
  22. Ryan, D.M., 'The solution of massive generalized set partitioning problems in aircrew rostering,' Operations Research Society, Vol.43 (1992), pp.459-467
  23. Ryan, D.M, 'Optimization earns its wings,' ORMS Today, Vol.27, No.2(2000), pp.26-30
  24. Segal, M., 'The operator-scheduling problem : a network-flow approach,' Operations Research, Vol.22, No.4 (1974), pp. 808-823 https://doi.org/10.1287/opre.22.4.808
  25. Stojkovic, M, F. SOumis, and J. Desrosiers, 'The operational airline crew scheduling problem,' Transportation Science, Vol.32 (1998), pp.232-245
  26. Suhl, U.H. and L.M Suhl, 'Solving airline- fleet scheduling problems with mixed integer programming,' Operational Research in Industry, Eds. by T. Ciriani, S. Gliozzi, E.L. Johnson, and R. Tadei, Macmillan press Ltd., (1999), pp.135-156
  27. Teodorovic, D. and Lucie, P., 'A fuzzy set theory approach to the aircrew rostering problem,' Fuzzy sets and system, 95(1998), pp.261-271
  28. Van, S. and J.C. Chang. 'Airline cockpit crew scheduling,' European Journal of Operational Research, Vol.136 (2002), pp. 501-511
  29. Van, S. and Y.P. Tu. 'A network model for airline cabin crew scheduling,' European Journal of Operational Research, Vol.140 (2002), pp.531-540
  30. Van, S., T.T. Tung, and Y.P. Tu. 'Optimal construction of airline individual crew scheduling,' Computers and Operations Research, Vol.29 (2002), pp.341-363