Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation

Published Online:https://doi.org/10.1287/trsc.1110.0379

References

  • Barnhart C., Shenoi R. G. An approximate model and solution approach for the long-haul crew pairing problem. Transportation Sci. (1998) 32(3):221–231LinkGoogle Scholar
  • Barnhart C., Johnson E. L., Nemhauser G. L., Savelsbergh M. W. P., Vance P. H. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1998) 46(3):316–329LinkGoogle Scholar
  • Boubaker K., Desaulniers G., Elhallaoui I. Bidline scheduling with equity by heuristic dynamic constraint aggregation. Transportation Res. Part B: Methodological (2010) 44(1):50–61CrossrefGoogle Scholar
  • Campbell K. W., Durfee R. B., Hines G. S. FedEx generates bid lines using simulated annealing. Interfaces (1997) 27(2):1–16LinkGoogle Scholar
  • Christou I. T., Zakarian A., Liu J., Carter H. A two-phase genetic algorithm for large-scale bidline-generation problems at Delta Air Lines. Interfaces (1999) 29(5):51–65LinkGoogle Scholar
  • Cohn A., Barnhart C. Improving crew scheduling by incorporating key maintenance routing decisions. Oper. Res. (2003) 51(3):387–396LinkGoogle Scholar
  • Cordeau J.-F., Stojkovic G., Soumis F., Desrosiers J. Benders decomposition for simultaneous aircraft routing and crew scheduling. Transportation Sci. (2001) 35(4):375–388LinkGoogle Scholar
  • Desaulniers G., Desrosiers J., Dumas Y., Marc S., Rioux B., Solomon M. M., Soumis F. Crew pairing at Air France. Eur. J. Oper. Res. (1997) 97(2):245–259CrossrefGoogle Scholar
  • Desrosiers J., Lübbecke M. E., Desaulniers G., Desrosiers J., Solomon M. M. A primer in column generation. Column Generation (2005) (Springer, New York) 1–32CrossrefGoogle Scholar
  • Desrosiers J., Dumas Y., Solomon M. M., Soumis F., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Time constrained routing and scheduling. Network Routing (1995) 8(North-Holland, Amsterdam) 35–139Handbooks in Operations Research and Management ScienceCrossrefGoogle Scholar
  • Ehrgott M., Ryan D. Constructing robust crew schedules with bicriteria optimization. J. Multi-Criteria Decision Anal. (2002) 11(3):139–150CrossrefGoogle Scholar
  • Elhallaoui I., Desaulniers G., Metrane A., Soumis F. Bi-dynamic constraint aggregation and subproblem reduction. Comput. Oper. Res. (2008) 35(5):1713–1724CrossrefGoogle Scholar
  • Elhallaoui I., Metrane A., Soumis F., Desaulniers G. Multiphase dynamic constraint aggregation for set-partitioning type problems. Math. Programming A (2010) 123(2):345–370CrossrefGoogle Scholar
  • Elhallaoui I., Villeneuve D., Soumis F., Desaulniers G. Dynamic aggregation of set-partitioning constraints in column generation. Oper. Res. (2005) 53(4):632–645LinkGoogle Scholar
  • Gao C., Johnson E., Smith B. Integrated airline fleet and crew robust planning. Transportation Sci. (2009) 43(1):2–16LinkGoogle Scholar
  • Gopalakrishnan B., Johnson E. L. Airline crew scheduling: State-of-the-art. Ann. Oper. Res. (2005) 140(1):305–337CrossrefGoogle Scholar
  • Irnich S., Desaulniers G., Desaulniers G., Desrosiers J., Solomon M. M. Shortest path problems with resource constraints. Column Generation (2005) (Springer, New York) 33–65CrossrefGoogle Scholar
  • Jarrah A. I. Z., Diamond J. T. The problem of generating crew bidlines. Interfaces (1997) 27(4):49–64LinkGoogle Scholar
  • Klabjan D., Desaulniers G., Desrosiers J., Solomon M. M. Large-scale models in the airline industry. Column Generation (2005) (Springer, New York) 163–195CrossrefGoogle Scholar
  • Klabjan D., Johnson E., Nemhauser G. L. Solving large airline crew scheduling problems: Random pairing generation and strong branching. Comput. Optim. Appl. (2001) 20(1):73–91CrossrefGoogle Scholar
  • Klabjan D., Johnson E., Nemhauser G. L., Gelman E., Ramaswamy S. Airline crew scheduling with time windows and plane count constraints. Transportation Sci. (2002) 36(3):337–348LinkGoogle Scholar
  • Mercier A., Cordeau J. F., Soumis F. A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem. Comput. Oper. Res. (2005) 32(6):1451–1476CrossrefGoogle Scholar
  • Saddoune M., Desaulniers G., Soumis F. Aircrew pairings with possible repetitions of the same flight number. Comput. Oper. Res. (2010) . ePub ahead of print November 19, http://dx.doi.org/10.1016/j.cor.2010.11.003Google Scholar
  • Sandhu R., Klabjan D. Integrated airline fleeting and crew-pairing decisions. Oper. Res. (2007) 55(3):439–456LinkGoogle Scholar
  • Shebalov S., Klabjan D. Robust airline crew pairing: Move-up crews. Transportation Sci. (2006) 40(3):327–341LinkGoogle Scholar
  • Subramanian S., Sherali H. D. An effective deflected subgradient optimization scheme for implementing column generation for large-scale airline crew scheduling problems. INFORMS J. Comput. (2008) 20(4):565–578LinkGoogle Scholar
  • Vance P. H., Barnhart C., Johnson E. L., Nemhauser G. L. Airline crew scheduling: A new formulation and decomposition algorithm. Oper. Res. (1997) 45(2):188–200LinkGoogle Scholar
  • Weir J. D., Johnson E. L. A three-phase approach to solving the bidline problem. Ann. Oper. Res. (2004) 127(1–4):283–308CrossrefGoogle Scholar
  • Zeghal F. M., Minoux M. Modeling and solving a crew assignment problem in air transportation. Eur. J. Oper. Res. (2006) 175(1):187–209CrossrefGoogle 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.