Sensitivity Analysis of a Dynamic Fleet Management Model Using Approximate Dynamic Programming

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

References

  • Carvalho T. A., Powell W. B. A multiplier adjustment method for dynamic resource allocation problems. Transportation Sci. (2000) 34:150–164LinkGoogle Scholar
  • Crainic T., Gendreau M., Dejax P. Dynamic and stochastic models for the allocation of empty containers. Oper. Res. (1993) 41:102–126LinkGoogle Scholar
  • Dantzig G., Fulkerson D. Minimizing the number of tankers to meet a fixed schedule. Naval Res. Logist. Quart. (1954) 1:217–222CrossrefGoogle Scholar
  • Dejax P., Crainic T. A review of empty flows and fleet management models in freight transportation. Transportation Sci. (1987) 21:227–247LinkGoogle Scholar
  • Frantzeskakis L., Powell W. B. A successive linear approximation procedure for stochastic dynamic vehicle allocation problems. Transportation Sci. (1990) 24(1):40–57LinkGoogle Scholar
  • Glasserman P.Gradient Estimation via Perturbation Analysis (1991) (Kluwer Academic Publishers, Norwell, MA) Google Scholar
  • Godfrey G. A., Powell W. B. An adaptive, dynamic programming algorithm for stochastic resource allocation problems I: Single period travel times. Transportation Sci. (2002a) 36(1):21–39LinkGoogle Scholar
  • Godfrey G. A., Powell W. B. An adaptive, dynamic programming algorithm for stochastic resource allocation problems II: Multi-period travel times. Transportation Sci. (2002b) 36(1):40–54LinkGoogle Scholar
  • Hane C., Barnhart C., Johnson E., Marsten R., Nemhauser G., Sigismondi G. The fleet assignment problem: Solving a large-scale integer program. Math. Programming (1995) 70:211–232CrossrefGoogle Scholar
  • Ho Y.-C., Cao X.-R.Perturbation Analysis of Discrete Event Dynamic Systems (1991) (Kluwer Academic Publishers, Norwell, MA) CrossrefGoogle Scholar
  • Holmberg K., Joborn M., Lundgren J. T. Improved empty freight car distribution. Transportation Sci. (1998) 32:163–173LinkGoogle Scholar
  • Law A. L., Kelton W. D.Simulation Modeling and Analysis (2000) (McGraw-Hill, Boston, MA) Google Scholar
  • Nemhauser G., Wolsey L.Integer and Combinatorial Optimization (1988) (John Wiley & Sons, Chichester, UK) CrossrefGoogle Scholar
  • Powell W. B. A review of sensitivity results for linear networks and a new approximation to reduce the effects of degeneracy. Transportation Sci. (1989) 23(4):231–243LinkGoogle Scholar
  • Powell W. B., Jaillet P., Odoni A., Monma C., Magnanti T., Ball M. Stochastic and dynamic networks and routing. Networks. Handbook in Operations Research and Management Science (1995) (North-Holland, Amsterdam, The Netherlands) 141–295Google Scholar
  • Puterman M. L.Markov Decision Processes (1994) (John Wiley & Sons, New York) CrossrefGoogle Scholar
  • Topaloglu H., Powell W. B. Incorporating pricing decisions into the stochastic dynamic fleet management problem. (2005) . Technical report, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NYGoogle Scholar
  • Topaloglu H., Powell W. B. Dynamic programming approximations for stochastic, time-staged integer multicommodity flow problems. INFORMS J. Comput. (2006) 18(1):31–42LinkGoogle Scholar
  • Vanderbei R.Linear Programming: Foundations and Extensions (1997) (Kluwer’s International Series, Norwell, MA) Google 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.