A Column Generation Approach for Large-Scale Aircrew Rostering Problems

Published Online:https://doi.org/10.1287/opre.47.2.247

References

  • Antosik J. L. Automatic monthly crew assignment, a new approach. 1978 AGIFORS Sympos. Proc. (1978) 18:369–402Google Scholar
  • Barnhart C., Johnson E. L., Nemhauser G., Vance P. Solving binary cutting stock problems by column generation and branch-and-bound. Comput. Optim. Appl. (1995) 3:111–130Google Scholar
  • Buhr J. Four methods for monthly crew assignment—A comparison of efficiency. 1978 AGIFORS Sympos. Proc. (1978) 18:403–430Google Scholar
  • Byrne J. A preferential bidding system for technical aircrew. 1988 AGIFORS Sympos. Proc. (1988) 28:87–99Google Scholar
  • Caprara A., Fischetti M., Toth P. A heuristic algorithm for the set covering problem. (1995) . Working paper, University of Bologna, ItalyGoogle Scholar
  • CPLEX Reference ManualUsing the CPLEX Callable Library and CPLEX Mixed Integer Library (1992) (CPLEX Optimization Inc., Incline Village, NV) Google Scholar
  • Desaulniers G., Desrosiers J., Dumas Y., Marc S., Rioux B., Solomon M. M., Soumis F. Crew pairing at Air France. Euro. J. Oper. Res. (1997) 97:245–259CrossrefGoogle Scholar
  • Desrochers M., Soumis F. A column generation approach to the urban transit crew scheduling problem. Transportation Sci. (1989) 23:1–13LinkGoogle Scholar
  • Desrochers M., Desrosiers J., Solomon M. M. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. (1992) 40:342–354LinkGoogle Scholar
  • Desrosiers J., Dumas Y., Solomon M. M., Soumis F. Time constrained routing and scheduling. Handbooks Oper. Res. Management Sci. Network Routing (1995) 8:35–139CrossrefGoogle Scholar
  • Dumas Y., Desrosiers J., Soumis F. The pickup and delivery problem with time windows. Euro. J. Oper. Res. (1991) 54:7–22CrossrefGoogle Scholar
  • Gamache M., Soumis F., Yu G. A method for optimally solving the rostering problem. Operations Research in the Airline Industry (1998) (Kluwer, Boston) 124–157CrossrefGoogle Scholar
  • Giafferri C., Hamon J. P., Lengline J. G. Automatic monthly assignment of medium-haul cabin crew. 1982 AGIFORS Sympos. Proc. (1982) 22:69–95Google Scholar
  • Glanert W. A timetable approach to the assignment of pilots to rotations. 1984 AGIFORS Sympos. Proc. (1984) 24:369–391Google Scholar
  • Hoffman K. L., Padberg M. Solving airline crew scheduling problems by branch-and-cut. Management Sci. (1993) 39(6):657–682LinkGoogle Scholar
  • Ioachim I., Desrosiers J., Dumas Y., Solomon M. M., Villeneuve D. A request clustering algorithm for door-to-door handicapped transportation. Transportation Sci. (1995) 29:63–79LinkGoogle Scholar
  • Marchettini F. Automatic monthly cabin crew rostering procedure. 1980 AGIFORS Sympos. Proc. (1980) 20:23–59Google Scholar
  • Moore R., Evans J., Noo H. Computerized tailored blocking. 1978 AGIFORS Sympos. Proc. (1978) 18:343–361Google Scholar
  • Nicoletti B. Automatic crew rostering. Transportation Sci. (1975) 9:33–42LinkGoogle Scholar
  • Ribeiro C., Soumis F. A column generation approach to the multiple depot vehicle scheduling problem. Oper. Res. (1994) 42:41–53LinkGoogle Scholar
  • Rousseau J. M., Desrosiers J., Daduna J. R. Result obtained with CREW-OPT, a column generation method for transit crew scheduling. Lecture Notes in Econom. Math. Systems (1995) 430:349–358CrossrefGoogle Scholar
  • Ryan D. M. The solution of massive generalized set partitioning problems in air crew rostering. J. Oper. Res. Soc. (1992) 43:459–467CrossrefGoogle Scholar
  • Ryan D. M., Falkner J. C. On the integer properties of scheduling set partitioning models. Euro. J. Oper. Res. (1988) 35:442–456CrossrefGoogle Scholar
  • Sarra D. The automatic assignment model. 1988 AGIFORS Sympos. Proc. (1988) 28:23–37Google Scholar
  • Tingley G. A. Still another solution method for the monthly aircrew assignment problem. 1979 AGIFORS Sympos. Proc. (1979) 19:143–203Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.