A theoretical comparison of feasibility cuts for the integrated aircraft-routing and crew-pairing problem

Transportation Science

Volumn 42, Issue 1, 2008, Pages 87-104

  Mercier, Anne ^a  

^a GERAD   (Canada)

Author keywords

Aircraft routing; Benders decomposition; Crew pairing; Extreme rays; Feasibility cuts; Integrated planning

Indexed keywords

AIRCRAFT; FIGHTER AIRCRAFT; STOCHASTIC PROGRAMMING;

AIRCRAFT ROUTING; BENDERS DECOMPOSITION; CREW PAIRING; EXTREME RAYS; FEASIBILITY CUTS; INTEGRATED PLANNING;

PROBLEM SOLVING;

EID: 70449675050     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1070.0197     Document Type: Article

References (16)

1. Benders, J. F. 1962. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4 238-252.
2. Bertsimas, D., J. N. Tsitsiklis. 1997. Introduction to Linear Optimization. Athena Scientific, Nashua, NH.
3. Cohn, A. M., C. Barnhart. 2003. Improving crew scheduling by incorporating key maintenance routing decisions. Oper. Res. 51 387-396.
4. Cordeau, J.-F., F. Pasin, M. M. Salomon. 2006. An integrated model for logistics network design. Ann. Oper. Res. 144 59-82.
5. Cordeau, J.-F., F. Soumis, J. Desrosiers. 2001a. Simultaneous assignment of locomotives and cars to passenger trains. Oper. Res. 49 531-548.
6. Cordeau, J.-F., G. Stojković, F. Soumis, J. Desrosiers. 2001b. Benders decomposition for simultaneous aircraft routing and crew scheduling. Transportation Sci. 35 375-388.
7. Desaulniers, G., J. Desrosiers, I. Ioachim, M. M. Solomon, F. Soumis, D. Villeneuve. 1998. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. T. G. Crainic, G. Laporte, eds. Fleet Management and Logistics. Kluwer, Boston, MA, 57-93.
8. Huang, H.-C., Z. Liang, R. Li. 2003. Solving integrated aircraft routing and crew scheduling problem by Benders decomposition. INFORMS Annual Meeting, Atlanta.
9. Klabjan, D., E. L. Johnson, G. L. Nemhauser. 2002. Airline crew scheduling with time windows and plane count constraints. Transportation Sci. 36 337-348.
10. Magnanti, T. L., R. T. Wong. 1981. Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Oper. Res. 29 464-484.
11. Mercier, A. 2006. Méthodes de décomposition pour la planifi-cation intégrée des rotations d'équipages et des itinéraires d'avions. Unpublished doctoral dissertation, école Polytech-nique de Montréal, Montréal.
12. Mercier, A., J.-F. Cordeau, F. Soumis. 2005. A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem. Comput. Oper. Res. 32 1451-1476.
13. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. John Wiley & Sons, New York.
14. Rasmussen, R. V. 2006. Hybrid IP/CP methods for solving sports scheduling problems. Unpublished doctoral dissertation, University of Aarhus, Aarhus, Denmark.
15. Santoso, T., S. Ahmed, M. Goetschalckx, A. Shapiro. 2005. A stochastic programming approach for supply chain network design under uncertainty. Eur. J. Oper. Res. 167 96-115.
16. Yu, G., ed. 1998. Operations Research in the Airline Industry. Kluwer, Boston, MA.