Value function approximation using multiple aggregation for multiattribute resource management

Journal of Machine Learning Research

Volumn 9, Issue , 2008, Pages 2079-2111

  George, Abraham ^a   Powell, Warren B ^a   Kulkarni, Sanjeev R ^a  

^a Princeton University   (United States)

Author keywords

Adaptive learning; Approximate dynamic programming; Hierarchical statistics; Mixture models; Multiattribute resources

Indexed keywords

AGGLOMERATION; DYNAMIC PROGRAMMING; INFORMATION MANAGEMENT; MANAGEMENT; POLYNOMIAL APPROXIMATION; REINFORCEMENT LEARNING; RESOURCE ALLOCATION; SYSTEMS ENGINEERING;

ADAPTIVE LEARNING; APPROXIMATE DYNAMIC PROGRAMMING; HIERARCHICAL STATISTICS; MIXTURE MODELS; MULTIATTRIBUTE RESOURCES;

PROBLEM SOLVING;

EID: 56349109509     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (34)

1. M. Athans, D. Bertsekas, W. McDermott, J. Tsitsiklis, and B. Van Roy. Intelligent optimal control. Technical report, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, 1995.
2. J.C. Bean, J.R. Birge, and R.L. Smith. Aggregation in dynamic programming. Operations Research, 35:215-220, 1987.
3. D. Bertsekas and D. Castanon. Adaptive aggregation methods for infinite horizon dynamic programming. IEEE Transactions on Automatic Control, 34(6):589-598, 1989.
4. D.R Bertsekas and J.N. Tsitsiklis. Neuro-Dynamic Programming. Athena Scientific, Belmont, MA, 1996.
5. C. Boutilier, T. Dean, and S. Hanks. Decision-theoretic planning: structural assumptions and computational leverage. J. of Artificial Intelligence, 11:1-94, 1999.
6. C. Boutilier, R. Dearden, and M. Goldszmidt. Stochastic dynamic programming with factored representations. Artificial Intelligence, 121(1-2):49-107, 2000. URL citeseer.ist.psu.edu/boutilier99stochastic.html.
7. L. Breiman. Stacked regression. Machine Learning, 24:49-64, 1996.
8. B. Efron and R. Tibshirani. An Introduction to the Bootstrap. Chapman & Hall/CRC, 1993.
9. Z. Feng, E. A. Hansen, and S. Zilberstein. Symbolic generalization for on-line planning. In Christopher Meek and Uffe Kjærulff, editors, UAI, pages 209-216. Morgan Kaufmann, 2003. ISBN 0-127-05664-5.
10. M. Gendreau and J. Y. Potvin. Dynamic vehicle routing and dispatching. In T.G. Crainic and G. Laporte, editors, Fleet Management and Logistics, pages 115-126. Kluwer Academic Publishers, 1998.
11. I. Guttman, S.S. Wilks, and J.S. Hunter. Introductory Engineering Statistics. John Wiley and Sons, Inc., New York, NY, 1965.
12. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning. Springer series in Statistics, New York, NY, 2001.
13. S. Ichoua, M. Gendreau, and J.-Y. Potvin. Exploiting knowledge about future demands for real-time vehicle dispatching. Transportation Science, 40(2):211-225, 2005.
14. K.E. Kim and T. Dean. Solving factored MDP's using non-homogeneous partitions. Artificial Intelligence, 147(1-2):225-251, 2003.
15. M. LeBlanc and R. Tibshirani. Combining estimates in regression and classification. Journal of the American Statistical Association, 91:1641-1650, 1996.
16. R. Luus. Iterative Dynamic Programming. Chapman & Hall/CRC, New York, 2000.
17. R. Mendelssohn. An iterative aggregation procedure for Markov decision processes. Operations Research, 30(1):62-73, 1982.
18. W. B. Powell. Approximate Dynamic Programming: Solving the curses of dimensionality. John Wiley and Sons, New York, 2007.
19. W. B. Powell and T. A. Carvalho. Dynamic control of logistics queueing networks for large-scale fleet management. Transportation Science, 32(2):90-109, 1998.
20. W. B. Powell, J. A. Shapiro, and H. P. Simão. An adaptive dynamic programming algorithm for the heterogeneous resource allocation problem. Transportation Science, 36(2):231-249, 2002.
21. D. Rogers, R. Plante, R. Wong, and J. Evans. Aggregation and disaggregation techniques and methodology in optimization. Operations Research, 39(4):553-582, 1991.
22. N. Secomandi. Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Computers and Operations Research, 27(11): 1201-1225, 2000.
23. N. Secomandi. A rollout policy for the vehicle routing problem with stochastic demands. Operations Research, 49(5):796-802, 2001.
24. H. P. Simao, J. Day, A. P. George, T. Gifford, J. Nienow, and W. B. Powell. An approximate dynamic programming algorithm for large-scale fleet management: A case application. Transportation Science, (to appear), 2008.
25. M. Spivey and W. B. Powell. The dynamic assignment problem. Transportation Science, 38(4): 399-419, 2004.
26. R.S. Sutton. Learning to predict by the methods of temporal differences. Machine Learning, 3: 9-44, 1988.
27. R.S. Sutton and A.G. Barto. Reinforcement Learning. The MIT Press, Cambridge, Massachusetts, 1998.
28. J. N. Tsitsiklis and B. Van Roy. Feature-based methods for large scale dynamic programming. Machine Learning, 22:59-94, 1996.
29. X. Wang and T. G. Dietterich. Efficient value function approximation using regression trees. In J. Boyan, W. Buntine, and A. Jagota, editors, Statistical Machine Learning for Large Scale Optimization, Neural Computing Surveys. 2000.
30. C.J.C.H. Watkins. Learning from delayed rewards. Ph.d. thesis, Cambridge University, Cambridge, UK, 1989.
31. W. Whitt. Approximations of dynamic programs I. Mathematics of Operations Research, 3:231-243, 1978.
32. D. Wolpert. Stacked generalization. Neural Networks, 5:241-259, 1992.
33. Y. Yang. Adaptive regression by mixing. Journal of the American Statistical Association, 96, 2001.
34. Q. Zhang and S. P. Sethi. Near optimization of dynamic systems by decomposition and aggregation. Journal of Optimization Theory and Applications, 99(1):1-22, 1998.