Skip to main content
SpringerLink
Log in

A Representational Paradigm for Dynamic Resource Transformation Problems

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. D. Adelman and G. Nemhauser, Price-directed control of remnant inventory systems, Operations Research 47(6) (1999) 889–898.

    Google Scholar 

  2. G. Andreatta and G. Romanin-Jacur, The flow management problem, Transportation Science 21(4) (1987) 249–253.

    Google Scholar 

  3. J. Aronson and B. Chen, A computational study of empirical decision horizons in infinite horizon multiperiod network flow models Working paper 89-275, Department of Management Sci. and Information Tech., University of Georgia (1989).

  4. D. Bertsekas and J. Tsitsiklis, Neuro-Dynamic Programming (Athena Scientific, Belmont, MA, 1996).

    Google Scholar 

  5. C. Bes and S. Sethi, Concepts of forecast and decision horizons: Applications to dynamic stochastic optimization problems, Mathematics of Operations Research 13(2) (1988) 295–310.

    Google Scholar 

  6. S. Bhaskaran and S. Sethi, Decision and forecast horizons in a stochastic environment: A survey, Optimal Control Applications and Methods 8(1) (1987) 61–67.

    Google Scholar 

  7. J. Birge, Decomposition and partitioning techniques for multistage stochastic linear programs, Operations Research 33(5) (1985) 989–1007.

    Google Scholar 

  8. L. Bodin and B. Golden, Classification in vehicle routing and scheduling, Networks 11 (1981) 97–108.

    Google Scholar 

  9. Z.-L. Chen and W.B. Powell, A convergent cutting-plane and partial-sampling algorithm for multistage stochastic linear programs with recourse, Journal of Optimization Theory and Applications 102(3) (1999) 497–524.

    Google Scholar 

  10. R. Cheung and W.B. Powell, An algorithm for multistage dynamic networks with random arc capacities, with an application to dynamic fleet management, Operations Research 44(6) (1996) 951–963.

    Google Scholar 

  11. T. Crainic, M. Gendreau and P. Dejax, Dynamic stochastic models for the allocation of empty containers, Operations Research 41 (1993) 102–126.

    Google Scholar 

  12. T. Crainic and J. Roy, Design of regular intercity driver routes for the LTL motor carrier industry, Transportation Science 26 (1992) 280–295.

    Google Scholar 

  13. H. Eiselt, G. Laporte and J.-F. Thisse, Competitive location models: A framework and bibliography, Transportation Science 27 (1993) 44–54.

    Google Scholar 

  14. R. Fourer, D. Gay and B. Kernighan, A mathematical programming language, Management Science 36 (1990) 519–554.

    Google Scholar 

  15. A. Geoffrion, The formal aspects of structured modeling, Operations Research 37(1) (1989) 30–51.

    Google Scholar 

  16. A. Geoffrion, An introduction to structured modeling, Management Science 33 (1989) 547–588.

    Google Scholar 

  17. A. Geoffrion, The SML language for structured modeling: Levels 1 and 2, Operations Research 40(1) (1992) 38–57.

    Google Scholar 

  18. A. Geoffrion, The SML language for structured modeling: Levels 3 and 4, Operations Research 40(1) (1992) 58–75.

    Google Scholar 

  19. G. Godfrey and W.B. Powell, An adaptive, dynamic programming algorithm for stochastic resource allocation problems I: Single period travel times, Technical report CL-00-04, Department of Operations Research and Financial Engineering, Princeton University (2000).

  20. D. Gross and C. Harris, Fundamentals of Queueing Theory (Wiley, New York, 1985).

    Google Scholar 

  21. A. Haghani, Formulation and solution of a combined train routing and makeup, and empty car distribution model, Transportation Research 23B(6) (1989) 433–452.

    Google Scholar 

  22. C. Hane, C. Barnhart, E. Johnson, R. Marsten, G. Nemhauser and G. Sigismondi, The fleet assignment problem: Solving a large-scale integer program, Math. Programming 70 (1995) 211–232.

    Google Scholar 

  23. H. Herren, The distribution of empty wagons by means of computer: An analytical model for the Swiss Federal Railways (SSB), Rail International 4(1) (1973) 1005–1010.

    Google Scholar 

  24. J. Higle and S. Sen, Stochastic decomposition: An algorithm for two stage linear programs with recourse, Mathematics of Operations Research 16(3) (1991) 650–669.

    Google Scholar 

  25. G. Infanger and D. Morton, Cut sharing for multistage stochastic linear programs with interstate dependency, Mathematical Programming 75 (1996) 241–256.

    Google Scholar 

  26. W. Jordan and M. Turnquist, A stochastic dynamic network model for railroad car distribution, Transportation Science 17 (1983) 123–145.

    Google Scholar 

  27. V. Mendiratta and M. Turnquist, A model for the management of empty freight cars, Trans. Res. Rec. 838 (1982) 50–55.

    Google Scholar 

  28. D. Morton, An enhanced decomposition algorithm for multistage stochastic hydroelectric scheduling, Annals of Operations Research 64 (1996) 211–235.

    Google Scholar 

  29. A. Odoni, The flow management problem in air traffic control, in: Flow Control of Congested Networks, eds. L.B.A.R. Odoni and G. Szego (Springer, New York, 1986) pp. 269–288.

    Google Scholar 

  30. M. Pereira and L. Pinto, Multistage stochastic optimization applied to energy planning, Mathematical Programming 52 (1991) 359–375.

    Google Scholar 

  31. M. Pinedo, Scheduling: Theory, Algorithms, and Systems (Prentice-Hall, Englewood Cliffs, NJ, 1995).

    Google Scholar 

  32. W.B. Powell, A local improvement heuristic for the design of less-than-truckload motor carrier networks, Transportation Science 20(4) (1986) 246–257.

    Google Scholar 

  33. W.B. Powell, Optimization models and algorithms: An emerging technology for the motor carrier industry, IEEE Transactions on Vehicular Technology 40 (1991) 68–80.

    Google Scholar 

  34. W.B. Powell, A stochastic formulation of the dynamic assignment problem, with an application to truckload motor carriers, Transportation Science 30(3) (1996) 195–219.

    Google Scholar 

  35. W.B. Powell and T.A. Carvalho, Dynamic control of ogistics queueing network for large-scale fleet management, Transportation Science 32(2) (1998) 90–109.

    Google Scholar 

  36. W.B. Powell, G. Godfrey, K. Papadaki, M. Spivey and H. Topaloglu, Adaptive dynamic programming for multistage stochastic resource allocation, Technical Report CL-01-04, Department of Operations Research and Financial Engineering, Princeton University (2000).

  37. W.B. Powell and J.A. Shapiro, A dynamic programming approximation for ultra large-scale dynamic resource allocation problems, Technical Report SOR-96-06, Department of Operations Research and Financial Engineering, Princeton University (1996).

  38. M.L. Puterman, Markov Decision Processes (Wiley, New York, 1994).

    Google Scholar 

  39. R.T. Rockafellar, Augmented Lagrangians and applications of the proximal point algorithm in convex programming, Mathematics of Operations Research 1 (1976) 97–116.

    Google Scholar 

  40. P. Schrijver, Supporting Fleet Management by Mobile Communications (P.R. Schrijver, The Netherlands, 1993).

    Google Scholar 

  41. S. Sethi and S. Bhaskaran, Conditions for the existence of decision horizons for discounted problems in a stochastic environment, Operations Research Letters 4(2) (1985) 61–64.

    Google Scholar 

  42. J.A. Shapiro and W.B. Powell, An object-oriented framework for dynamic resource transformation problems, Technical Report SOR-98-07, Department of Operations Research and Financial Engineering, Princeton University (1998).

  43. J.A. Shapiro andW.B. Powell, A metastrategy for large-scale resource management based on informational decomposition. Technical Report CL-99-03, Department of Operations Research and Financial Engineering, Princeton University (1999).

  44. R. Sutton and A. Barto, Reinforcement Learning (The MIT Press, Cambridge, MA, 1998).

    Google Scholar 

  45. R. Van Slyke and R.Wets, L-shaped linear programs with applications to optimal control and stochastic programming, SIAM Journal of Applied Mathematics 17(4) (1969) 638–663.

    Google Scholar 

  46. D. White, Decision roll and horizon roll processes in infinite horizon discounted Markov decision processes, Management Science 42(1) (1996) 37–50.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ, 08544, USA

    Warren B. Powell, Joel A. Shapiro & Hugo P. Simao

Authors
  1. Warren B. Powell
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joel A. Shapiro
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hugo P. Simao
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Powell, W.B., Shapiro, J.A. & Simao, H.P. A Representational Paradigm for Dynamic Resource Transformation Problems. Annals of Operations Research 104, 231–279 (2001). https://doi.org/10.1023/A:1013111608059

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1013111608059

Keywords

Search

Navigation