Incorporating Pricing Decisions into the Stochastic Dynamic Fleet Management Problem

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

References

  • Adelman D. Price-directed control of a closed logistics queueing network. (2004) . Technical report, Graduate School of Business, The University of Chicago, Chicago, ILGoogle Scholar
  • Bertsekas D. P., Tsitsiklis J. N.Neuro-Dynamic Programming (1996) (Athena Scientific, Belmont, MA) Google Scholar
  • Bertsimas D., de Boer S. Simulation-based booking limits for airline revenue management. Oper. Res. (2005) 53(1):90–106LinkGoogle Scholar
  • Birge J. R., Louveaux F.Introduction to Stochastic Programming (1997) (Springer-Verlag, New York) Google Scholar
  • 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
  • Ermoliev Y., Ermoliev Y., Wets R. Stochastic quasi-gradient methods. Numerical Techniques for Stochastic Optimization (1988) (Springer-Verlag, Berlin, Germany) CrossrefGoogle Scholar
  • Ferguson A., Dantzig G. B. The problem of routing aircraft—A mathematical solution. Aeronautical Engrg. Rev. (1955) 14:51–55Google 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
  • Fu M. C. Sample path derivatives for (s, S) inventory systems. Oper. Res. (1994) 42(2):351–363LinkGoogle Scholar
  • Glasserman P.Gradient Estimation via Perturbation Analysis (1991) (Kluwer Academic Publishers, Norwell, MA) Google Scholar
  • Glasserman P., Tayur S. Sensitivity analysis for base-stock levels in multiechelon production-inventory systems. Management Sci. (1995) 41(2):263–281LinkGoogle Scholar
  • Godfrey G. A., Powell W. B. An adaptive, dynamic programming algorithm for stochastic resource allocation problems I: Single period travel times. Transportation Sci. (2002) 36(1):21–39LinkGoogle Scholar
  • Gorman M. F. Intermodal pricing model creates a network pricing perspective at BNSF. Interfaces (2001) 31(4):37–49LinkGoogle Scholar
  • Higle J. L., Zhao L. Adaptive and nonadaptive samples in solving stochastic linear programs: A computational investigation. (2004) . Technical report, Department of Systems and Industrial Engineering, The University of Arizona, Tucson, AZGoogle Scholar
  • Jordan W., Turnquist M. A stochastic dynamic network model for railroad-car distribution. Transportation Sci. (1983) 17:123–145LinkGoogle Scholar
  • Karaesmen I., van Ryzin G. Overbooking with substitutable inventory classes. Oper. Res. (2004) 52(1):83–104LinkGoogle Scholar
  • Kesten H. Accelerated stochastic approximation. Ann. Math. Statist. (1958) 29(4):41–59CrossrefGoogle Scholar
  • King G. J., Topaloglu H. Incorporating the pricing decisions into dynamic fleet management models. J. Oper. Res. Soc. (2006) . ForthcomingGoogle Scholar
  • Kleywegt A. J., Nori V. S., Savelsbergh M. W. P. The stochastic inventory routing problem with direct deliveries. Transportation Sci. (2002) 36(1):94–118LinkGoogle Scholar
  • Law A. L., Kelton W. D.Simulation Modeling and Analysis (2000) (McGraw-Hill, Boston, MA) Google Scholar
  • Mahajan S., van Ryzin G. Stocking retail assortments under dynamic customer substitution. Oper. Res. (2001) 49(3):334–351LinkGoogle Scholar
  • Nemhauser G., Wolsey L.Integer and Combinatorial Optimization (1988) (John Wiley & Sons, Inc., Chichester, UK) CrossrefGoogle Scholar
  • Powell W. B. Marginal cost pricing of truckload services: A comparison of two approaches. Transportation Res. Part B (1985) 19(5):433–445CrossrefGoogle 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., Ruszczynski A., Topaloglu H. Learning algorithms for separable approximations of stochastic optimization problems. Math. Oper. Res. (2004) 29(4):814–836LinkGoogle Scholar
  • Powell W. B., Sheffi Y., Nickerson K., Butterbaugh K., Atherton S. Maximizing profits for North American Van Lines truckload division: A new framework for pricing and operations. Interfaces (1988) 18:21–41LinkGoogle Scholar
  • Puterman M. L.Markov Decision Processes (1994) (John Wiley and Sons, Inc., New York) CrossrefGoogle Scholar
  • Royden H. L.Real Analysis (1988) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • Talluri K. T., van Ryzin G. J.The Theory and Practice of Revenue Management (2004) (Kluwer Academic Publishers, Dordrecht, The Netherlands) CrossrefGoogle Scholar
  • Topaloglu H., Powell W. B. Sensitivity analysis of a dynamic fleet management model using approximate dynamic programming. Oper. Res. (2007) 55(2):319–331LinkGoogle 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
  • van Ryzin G., Vulcano G. Simulation-based optimization of virtual nesting controls for network-revenue management. Oper. Res. (2006) . ForthcomingGoogle Scholar
  • White W. Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers. Networks (1972) 2(3):211–236CrossrefGoogle Scholar
  • White W., Bomberault A. A network algorithm for empty freight car allocation. IBM Systems J. (1969) 8(2):147–171CrossrefGoogle 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.