An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization

Annals of Operations Research

Volumn 184, Issue 1, 2011, Pages 233-271

  Mercier, Luc ^a   van Hentenryck, Pascal ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

Endogenous uncertainty; Scheduling; Stochastic optimization

Indexed keywords

EID: 79952281575     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-010-0798-7     Document Type: Article

References (23)

1. Barto, A. G., Bradtke, S. J., & Singh, S. P. (1995). Learning to act using real-time dynamic programming. Artificial Intelligence, 72(1), 81-138.
2. Benoist, T., Bourreau, E., Caseau, Y., & Rottembourg, B. (2001). Towards stochastic constraint programming: a study of online multi-choice Knapsack with deadlines. In: CP'01.
3. Bent, R., & van Hentenryck, P. (2004). Scenario based planning for partially dynamic vehicle routing problems with stochastic customers. Operations Research, 52(6), 977-987.
4. Bent, R., & van Hentenryck, P. (2007). Waiting and relocation strategies in online stochastic vehicle routing. In: IJCAI'2007.
5. Bonet, B., & Geffner, H. (2003). Faster heuristic search algorithms for planning with uncertainty and full feedback. In: IJCAI'2003.
6. Bonet, B., & Geffner, H. (2006). Learning depth-first search: a unified approach to heuristic search in deterministic and non-deterministic settings, and its application to mdps. In: ICAPS'2006.
7. Chang, H., Givan, R., & Chong, E. (2000). Online scheduling via sampling. In: AIPS'00.
8. Choi, J., Realff, M. J., & Lee, J. H. (2004). Dynamic programming in a heuristically confined state space: a stochastic resource-constrained project scheduling appplication. Computers and Chemical Engineering, 28(6-7), 1039-1058.
9. Dempster, M. A. H. (1998). Sequential importance sampling algorithms for dynamic stochastic programming. Annals of Operations Research, 84, 1422-1444.
10. Dooms, G., & van Hentenryck, P. (2008). Gap reduction techniques for online stochastic project scheduling. In: CPAIOR'08.
11. Dupacova, J., Consigli, G., & Wallace, S. W. (2000). Scenarios for multistage stochastic programs. Annals of Operations Research, 100(1-4), 25-53.
12. Dupacova, J., Groewe-Kuska, N., & Roemisch, W. (2003). Scenario reduction in stochastic programming: an approach using probability metrics. Mathematical Programming, Ser. A, 95(4).
13. Goel, V., & Grossmann, I. E. (2006). A class of stochastic programs with decision dependent uncertainty. Mathematical Programming, 108(2-3), 355-394.
14. Hansen, E. A., & Zilberstein, S. (2001). LAO: a heuristic-search algorithm that finds solutions with loops. Artificial Intelligence, 129(1-2), 35-62.
15. Kearns, M., Mansour, Y., & Ng, A. (1999). A sparse sampling algorithm for near-optimal planning in large Markov decision processes. In: IJCAI'1999.
16. Mak, W. K., Morton, D. P., & Wood, R. K. (1999). Monte Carlo bounding techniques for determining solution quality in stochastic programs. Operations Research Letters, 24, 47-56.
17. McMahan, H. B., Likhachev, M., & Gordon, G. J. (2005). Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees. In: ICML'2005. New York: ACM.
18. Mercier, L., & van Hentenryck, P. (2007). Performance analysis of online anticipatory algorithms for large multistage stochastic integer programs. In: IJCAI 07 (Vol. 2).
19. Parkes, D., & Duong, A. (2007). An ironing-based approach to adaptive online mechanism design in single-valued domains. In: AAAI'07.
20. Ruszczynski, A., Shapiro, A. (Eds.) (2003). Handbooks in operations research and management series: Vol. 10. Stochastic programming. Amsterdam: Elsevier.
21. Shapiro, A. (2006). On complexity of multistage stochastic programs. Operations Research Letters, 34(1), 1-8.
22. Thomas, M., & Szczerbicka, H. (2007). Evaluating online scheduling techniques in uncertain environments. In: MISTA'07.
23. van Hentenryck, P., & Bent, R. (2006). Online stochastic combinatorial optimization. Cambridge: MIT Press.