메뉴 건너뛰기




Volumn 97, Issue 2, 1997, Pages 245-259

Crew pairing at Air France

Author keywords

Crew pairing; Dantzig Wolfe decomposition; Integer nonlinear programming; Multi commodity flow model; Set partitioning

Indexed keywords

AIR TRAFFIC CONTROL; AIR TRANSPORTATION; ALGORITHMS; COMPUTER SIMULATION; COST EFFECTIVENESS; DYNAMIC PROGRAMMING; EXPERT SYSTEMS; LAWS AND LEGISLATION; NONLINEAR PROGRAMMING; SCHEDULING;

EID: 0031104166     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00195-6     Document Type: Article
Times cited : (138)

References (34)
  • 1
    • 0002159168 scopus 로고
    • Recent advances in crew pairing optimization at American Airlines
    • Anbil, R., Gelman, E., Patty, B., and Tanga, R., (1991), "Recent advances in crew pairing optimization at American Airlines", Interfaces 21, 62-74.
    • (1991) Interfaces , vol.21 , pp. 62-74
    • Anbil, R.1    Gelman, E.2    Patty, B.3    Tanga, R.4
  • 3
    • 0009658680 scopus 로고
    • The development of a heuristic set covering based system for air crew scheduling
    • Baker, E.K., Bodin, L.D., and Fisher, M. (1985), "The development of a heuristic set covering based system for air crew scheduling", Transportation Policy Decision Making 3, 95-110.
    • (1985) Transportation Policy Decision Making , vol.3 , pp. 95-110
    • Baker, E.K.1    Bodin, L.D.2    Fisher, M.3
  • 4
    • 0022061023 scopus 로고
    • A graph partitioning approach to airline crew scheduling
    • Ball, M., and Roberts, A. (1985), "A graph partitioning approach to airline crew scheduling", Transportation Science 19, 107-126.
    • (1985) Transportation Science , vol.19 , pp. 107-126
    • Ball, M.1    Roberts, A.2
  • 6
    • 0001075766 scopus 로고
    • Deadhead selection for the long-haul crew pairing problem
    • Barnhart, C., Hatay, L., and Johnson, E.L. (1995), "Deadhead selection for the long-haul crew pairing problem", Operations Research 43, 491-499.
    • (1995) Operations Research , vol.43 , pp. 491-499
    • Barnhart, C.1    Hatay, L.2    Johnson, E.L.3
  • 7
    • 0001932698 scopus 로고
    • Airline crew scheduling: Supercomputers and algorithms
    • Barutt, J., and Hull, T. (1990), "Airline crew scheduling: Supercomputers and algorithms", SIAM News 23/6, pp. 1, 20-22.
    • (1990) SIAM News , vol.23 , Issue.6 , pp. 1
    • Barutt, J.1    Hull, T.2
  • 10
    • 0023349540 scopus 로고
    • The column generation principle and the airline crew scheduling problem
    • Crainic, T.G., and Rousseau, J.M. (1987), "The column generation principle and the airline crew scheduling problem", INFOR 25, 136-151.
    • (1987) INFOR , vol.25 , pp. 136-151
    • Crainic, T.G.1    Rousseau, J.M.2
  • 11
    • 0001391104 scopus 로고
    • Decomposition principle for linear programs
    • Dantzig, G., and Wolfe, P. (1960), "Decomposition principle for linear programs", Operations Research 8, 101-111.
    • (1960) Operations Research , vol.8 , pp. 101-111
    • Dantzig, G.1    Wolfe, P.2
  • 13
    • 0002814836 scopus 로고
    • A column generation approach to the urban transit crew scheduling problem
    • Desrochers, M., and Soumis, F. (1989), "A column generation approach to the urban transit crew scheduling problem", Transportation Science 23, 1-13.
    • (1989) Transportation Science , vol.23 , pp. 1-13
    • Desrochers, M.1    Soumis, F.2
  • 14
    • 77957089136 scopus 로고
    • Time constrained vehicle routing and scheduling
    • M. Ball, T. Magnanti, C. Monma, and G. Nemhauser (eds.), on Network Routing, Elsevier Science, Amsterdam
    • Desrosiers, J., Dumas, Y., Solomon, M.M., and Soumis, F. (1995), "Time constrained vehicle routing and scheduling", in: M. Ball, T. Magnanti, C. Monma, and G. Nemhauser (eds.), Handbooks in Operations Research and Management Science, Volume 8 on Network Routing, Elsevier Science, Amsterdam, 35-139.
    • (1995) Handbooks in Operations Research and Management Science , vol.8 , pp. 35-139
    • Desrosiers, J.1    Dumas, Y.2    Solomon, M.M.3    Soumis, F.4
  • 18
    • 0002826414 scopus 로고
    • Suggested computation for maximal multi-commodity network flows
    • Ford, L.R., and Fulkerson, D.R. (1958), "Suggested computation for maximal multi-commodity network flows", Management Science 5, 97-101.
    • (1958) Management Science , vol.5 , pp. 97-101
    • Ford, L.R.1    Fulkerson, D.R.2
  • 19
    • 0003251798 scopus 로고
    • A new algorithm for very large crew pairing problems
    • Gerbracht, R. (1978), "A new algorithm for very large crew pairing problems" AGIFORS Proceedings XVIII, 315-341.
    • (1978) AGIFORS Proceedings XVIII , pp. 315-341
    • Gerbracht, R.1
  • 20
    • 0000291432 scopus 로고
    • Optimizing flight crew schedules
    • Gershkoff, I. (1989), "Optimizing flight crew schedules", Interfaces 19, 29-43.
    • (1989) Interfaces , vol.19 , pp. 29-43
    • Gershkoff, I.1
  • 21
    • 0001510482 scopus 로고
    • A linear programming approach to the cutting-stock problem
    • Gilmore, P.C., and Gomory, R.E. (1961), "A linear programming approach to the cutting-stock problem", Operations Research 9, 849-854.
    • (1961) Operations Research , vol.9 , pp. 849-854
    • Gilmore, P.C.1    Gomory, R.E.2
  • 22
    • 0000143954 scopus 로고
    • A linear programming approach to the cutting-stock problem - Part II
    • Gilmore, P.C., and Gomory, R.E. (1963), "A linear programming approach to the cutting-stock problem - Part II", Operations Research 11, 863-888.
    • (1963) Operations Research , vol.11 , pp. 863-888
    • Gilmore, P.C.1    Gomory, R.E.2
  • 24
    • 0039205838 scopus 로고
    • The HASTUS system: New algorithms and modules for the 90s
    • M. Desrochers, and J.-M. Rousseau (eds.), Computer-Aided Transit Scheduling, Springer, Berlin
    • Hamer, N., and Séguin, L. (1992), "The HASTUS system: New algorithms and modules for the 90s", in: M. Desrochers, and J.-M. Rousseau (eds.), Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 386, Springer, Berlin, 17-29.
    • (1992) Lecture Notes in Economics and Mathematical Systems , vol.386 , pp. 17-29
    • Hamer, N.1    Séguin, L.2
  • 25
    • 0027614308 scopus 로고
    • Solving airline crew scheduling problems by branch-and-cut
    • Hoffman, K.L., and Padberg, M. (1993), "Solving airline crew scheduling problems by branch-and-cut", Management Science 39, 657-682.
    • (1993) Management Science , vol.39 , pp. 657-682
    • Hoffman, K.L.1    Padberg, M.2
  • 27
    • 0023994772 scopus 로고
    • A new approach of crew pairing problems by column generation and application to air transport
    • Lavoie, S., Minoux, M., and Odier, E. (1988), "A new approach of crew pairing problems by column generation and application to air transport", European Journal of Operational Research 35, 45-58.
    • (1988) European Journal of Operational Research , vol.35 , pp. 45-58
    • Lavoie, S.1    Minoux, M.2    Odier, E.3
  • 28
    • 0018730045 scopus 로고
    • Crew planning at Flying Tiger: A successful application of integer programming
    • Marsten, R.E., Muller, M.R., and Killion, C.L. (1979), "Crew planning at Flying Tiger: A successful application of integer programming", Management Science 25, 1175-1183.
    • (1979) Management Science , vol.25 , pp. 1175-1183
    • Marsten, R.E.1    Muller, M.R.2    Killion, C.L.3
  • 29
    • 0019572291 scopus 로고
    • Exact solution of crew scheduling problems using set partitioning model: Recent successful applications
    • Marsten, R.E., and Shepardson, F. (1981), "Exact solution of crew scheduling problems using set partitioning model: Recent successful applications", Networks 11, 165-177.
    • (1981) Networks , vol.11 , pp. 165-177
    • Marsten, R.E.1    Shepardson, F.2
  • 30
    • 0001574448 scopus 로고
    • Results obtained with Crew-Opt, a column generation method for transit crew scheduling
    • J.R. Daduna, I. Branco and J.M. Pinto Paixão (eds.), Computer-Aided Transit Scheduling, Springer, Berlin
    • Rousseau, J.-M., and Desrosiers, J. (1995), "Results obtained with Crew-Opt, a column generation method for transit crew scheduling", in: J.R. Daduna, I. Branco and J.M. Pinto Paixão (eds.), Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 430, Springer, Berlin, 349-358.
    • (1995) Lecture Notes in Economics and Mathematical Systems , vol.430 , pp. 349-358
    • Rousseau, J.-M.1    Desrosiers, J.2
  • 31
    • 0015585112 scopus 로고
    • A technique for the solution of massive set covering problems, with application to airline crew scheduling
    • Rubin, J. (1973), "A technique for the solution of massive set covering problems, with application to airline crew scheduling", Transportation Science 7, 34-48.
    • (1973) Transportation Science , vol.7 , pp. 34-48
    • Rubin, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.