An Adaptive Dynamic Programming Algorithm for the Heterogeneous Resource Allocation Problem

References

  • Ahuja R., Magnanti T., Orlin J.Network Flows: Theory, Algorithms and Applications (1992) (Prentice Hall, New York) Google Scholar
  • Assad A. Multicommodity network flows: A survey. Networks (1987) 8(1):37–92CrossrefGoogle Scholar
  • Beale E., Dantzig G., Watson R. A first order approach to a class of multi-time period stochastic programming problems. Math. Programming Stud. (1986) 27:103–117CrossrefGoogle Scholar
  • Beale E., Forest J., Taylor C., Dempster M. Multi-time period stochasitc programming. Stochastic Programming (1980) (Academic Press, New York) 387–402Google Scholar
  • Bertsekas D., Tsitsiklis J.Neuro-Dynamic Programming (1996) (Athena Scientific, Belmont, MA) Google Scholar
  • Cheung R. K-M., Powell W. B. An algorithm for multistage dynamic networks with random arc capacities, with an application to dynamic fleet management. Oper. Res. (1996) 44:951–963LinkGoogle Scholar
  • Crainic T. G., Rousseau J-M. The column generation principle and the airline crew scheduling. INFOR (1987) 25:136–151Google Scholar
  • Desrosiers J., Solomon M., Soumis F., Monma C., Magnanti T., Ball M. Time constrained routing and scheduling. Handbook in Operations Research and Management Science (1995) (North-Holland)35–139Volume on NetworksGoogle Scholar
  • Desrosiers J., Soumis F., Desrochers M. Routing with time windows by column generation. Networks (1984) 14:545–565CrossrefGoogle Scholar
  • Frangioni A., Gallo G. A bundle type dual-ascent approach to linear multicommodity min-cost flow problems. INFORMS J. Comput. (1999) 11:370–393LinkGoogle Scholar
  • Frantzeskakis L., Powell W. B. A successive linear approximation procedure for stochastic dynamic vehicle allocation problems. Transportation Sci. (1990) 24:40–57LinkGoogle 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
  • Jones K., Lustig I., Farvolden J., Powell W. B. Multicommodity network flows: The impact of formulation on decomposition. Math. Programming (1993) 62:95–117CrossrefGoogle Scholar
  • Jordan W., Turnquist M. A stochastic dynamic network model for railroad car distribution. Transportation Sci. (1983) 17:123–145LinkGoogle Scholar
  • Kennington J., Helgason R.Algorithms for Network Programming (1980) (John Wiley & Sons, New York) Google Scholar
  • Lavoie S., Odier M. Minoux. E. A new approach for crew pairing problems by column generation with an application to air transport. Eur. J. Oper. Res. (1988) 35:45–58CrossrefGoogle Scholar
  • Powell W. B., Golden B., Assad A. A comparative review of alternative algorithms for the dynamic vehicle allocation problem. Vehicle Routing: Methods and Studies (1988) (North-dHolland, New York)249–292Google Scholar
  • Powell W. B., Carvalho T. A. Dynamic control of multicommodity fleet management problems. Eur. J. Oper. Res. (1997) 98:522–541CrossrefGoogle Scholar
  • Powell W. B., Carvalho T. A. Dynamic control of logistics queueing network for large-scale fleet management. Transportation Sci. (1998a) 32:90–109LinkGoogle Scholar
  • Powell W. B., Carvalho T. A. Real-time optimization of containers and flatcars for intermodal operations. Transporation Sci. (1998b) 32:110–126LinkGoogle Scholar
  • Powell W. B., Shapiro J. A., Simão H. P., Fourer R., Coullard C., Owens J. A representational paradigm for dynamic resource transformation problems. Ann. Oper. Res. (2002) (J. C. Baltzer AG)Google Scholar
  • Powell W. B., Jaillet P., Odoni A., Monma C., Magnanti T., Ball M. Stochastic and dynamic networks and routing. Handbook in Operations Research and Sci. (1995) (North-Holland)141–295Volume on NetworksGoogle Scholar
  • Powell W. B., Godfrey G., Papadaki K., Spivey M., Topaloglu H. Adaptive dynamic programming for multistage stochastic resource allocation. (2000) . Technical report CL-00-07, Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJGoogle Scholar
  • Rushmeier R. A., Kontogiorgis S. A. Advances in the optimization of airline fleet assignment. Transportation Sci.31:159–169LinkGoogle Scholar
  • Sutton R., Barto A.Reinforcement Learning (1998) (MIT Press, Cambridge, MA) Google Scholar
  • Tsitsiklis J., Van Roy B. An analysis of temporal-difference learning with function approximation. IEEE Trans. Automatic Control (1997) 42:674–690CrossrefGoogle Scholar
  • White W. Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers. Networks (1972) 2:211–236CrossrefGoogle 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.