Two-Stage Fleet Assignment Model Considering Stochastic Passenger Demands

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

References

  • Abara J. Applying integer linear programming to the fleet assignment problem. Interfaces (1989) 19(4):20–28LinkGoogle Scholar
  • Adams W. P., Sherali H. D. Mixed-integer bilinear programming problems. Math. Programming (1993) 59(3):279–305CrossrefGoogle Scholar
  • Ahuja R. K., Goodstein J., Mukherjee A., Orlin J. B., Sharma D. A very large-scale neighborhood search algorithm for the combined through and fleet assignment model. (2002) . Technical report, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
  • Ahuja R. K., Liu J., Goodstein J., Mukherjee A., Orlin J. B., Sharma D., Ciriani T. A., Fasano G., Gliozzi S., Tadei R. Solving multi-criteria through-fleet assignment models. Operations Research in Space and Air (2003) (Kluwer Academic Publishers, Dordrecht/Boston/London) 233–256CrossrefGoogle Scholar
  • Barnhart C., Kniker T. S., Lohatepanont M. Itinerary-based airline fleet assignment. Transportation Sci. (2002) 36:199–217LinkGoogle Scholar
  • Barnhart C., Boland N. L., Clarke L. W., Johnson E. L., Nemhauser G. L., Shenoi R. G. Flight string models for aircraft fleeting and routing. Transportation Sci. (1998) 32:208–220LinkGoogle Scholar
  • Berge M. E., Hopperstad C. A. Demand driven dispatch: A method for dynamic aircraft capacity assignment, models and algorithms. Oper. Res. (1993) 41:153–168LinkGoogle Scholar
  • Bish E. K., Suwandechochai R., Bish D. R. Strategies for managing the flexible capacity in the airline industry. Naval Res. Logist. (2004) 51:654–685CrossrefGoogle Scholar
  • Erdmann A., Kiahaschemi M., Noltemeier A., Schrader R. Fleet assignment with respect to itineraries. Internat. Sympos. Math. Programming (1997) Lausanne, SwitzerlandGoogle Scholar
  • Farkas A. The influence of network effects and yield management on airline fleet assignment decisions. (1995) . Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
  • Geoffrion A. M., Graves G. W. Multicommodity distribution system design by Benders decomposition. Management Sci. (1974) 20(5):822–844LinkGoogle Scholar
  • Glover F., Glover R., Lorenzo J., McMillan C. The passenger mix problem in the scheduled airlines. Interfaces (1982) 12:73–79LinkGoogle Scholar
  • Hane C. A., Barnhart C., Johnson E. L., Marsten R. E., Nemhauser G. L., Sigismondi G. The fleet assignment problem: Solving a large-scale integer program. Math. Programming (1995) 70:211–232CrossrefGoogle Scholar
  • Jacobs T. L., Smith B. C., Johnson E. O&D FAM: Incorporating passenger flows into the fleeting process. Proc. AGIFORS Sympos. (1999) New Orleans, LA:128–161Google Scholar
  • Kniker T. S. Itinerary-based airline fleet assignment. (1998) . Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
  • Levin A. Scheduling and fleet routing models for transportation systems. Transportation Sci. (1971) 5:232–255LinkGoogle Scholar
  • Listes O., Dekker R. A scenario aggregation-based approach for determining a robust airline fleet composition for dynamic capacity allocation. Transportation Sci. (2005) 39(3):367–382LinkGoogle Scholar
  • Mulvey J. M., Vanderbei R. J., Zenios S. A. Robust optimization of large-scale systems. Oper. Res. (1995) 43(2):264–281LinkGoogle Scholar
  • Pilla V. L., Rosenberger J. M., Chen V. C. P., Smith B. C. A statistical computer experiments approach to airline fleet assignment. (2005) . Technical report COSMOS-05-03, The University of Texas at Arlington, Arlington, TXGoogle Scholar
  • Sherali H. D., Adams W. P. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. (1990) 3(3):411–430CrossrefGoogle Scholar
  • Sherali H. D., Adams W. P. A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Appl. Math. (1994) 52(1):83–106CrossrefGoogle Scholar
  • Sherali H. D., Adams W. P.A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems (1999) (Kluwer Academic Publishers, Boston, MA) CrossrefGoogle Scholar
  • Sherali H. D., Fraticelli B. M. P. A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse. J. Global Optim. (2002) 22:319–342CrossrefGoogle Scholar
  • Sherali H. D., Bish E. K., Zhu X. Polyhedral analysis and algorithms for a demand driven re-fleeting model for aircraft assignment. Transportation Sci. (2005) 39(3):349–366LinkGoogle Scholar
  • Sherali H. D., Bish E. K., Zhu X. Airline fleet assignment concepts, models, and algorithms. Eur. J. Oper. Res. (2006) 172(1):1–30CrossrefGoogle Scholar
  • Smith B. C. Robust airline fleet assignment. (2004) . Ph.D. dissertation, Georgia Institute of Technology, Atlanta, GAGoogle Scholar
  • Smith B. C., Johnson E. L. Robust airline fleet assignment: Imposing station purity using station decomposition. Transportation Sci. (2006) 40(4):497–516LinkGoogle Scholar
  • Talluri T. K. Swapping applications in a daily airline fleet assignment. Transportation Sci. (1996) 30:237–248LinkGoogle Scholar
  • Zhu X. Discrete two-stage stochastic mixed-integer programs with applications to airline fleet assignment and workforce planning problems. (2006) . Ph.D. dissertation, Virginia Polytechnic Institute and State University, Blacksburg, VAGoogle 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.