메뉴 건너뛰기




Volumn 5-5, Issue , 2013, Pages 2989-3013

Rollout algorithms for discrete optimization: A survey

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC OPTIMIZATION PROBLEMS; DISCRETE OPTIMIZATION; OPTIMIZATION PROBLEMS; OPTIMIZATION VARIABLES; ROLLOUT ALGORITHMS; SEQUENTIAL APPROACH;

EID: 85003740908     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-4419-7997-1_8     Document Type: Chapter
Times cited : (40)

References (27)
  • 1
    • 0025386231 scopus 로고
    • Expected-outcome: A general model of static evaluation
    • B. Abramson, Expected-outcome: a general model of static evaluation. IEEE Trans. Pattern Anal. Mach. Intell. 12, 182-193 (1990)
    • (1990) IEEE Trans. Pattern Anal. Mach. Intell. , vol.12 , pp. 182-193
    • Abramson, B.1
  • 4
    • 33645410501 scopus 로고    scopus 로고
    • Dynamic programming and suboptimal control: A survey from ADP to MPC. Fundamental Issues in Control
    • D.P. Bertsekas, Dynamic programming and suboptimal control: a survey from ADP to MPC, in Fundamental Issues in Control. Eur J. Control, 11(4-5), 310-334 (2005)
    • (2005) Eur J Control , vol.11 , Issue.4-5 , pp. 310-334
    • Bertsekas, D.P.1
  • 5
    • 0344672463 scopus 로고    scopus 로고
    • Rollout algorithms for stochastic scheduling problems
    • D.P. Bertsekas, D.A. Castanon, Rollout algorithms for stochastic scheduling problems. Heuristics, 5, 89-108 (1999)
    • (1999) Heuristics , vol.5 , pp. 89-108
    • Bertsekas, D.P.1    Castanon, D.A.2
  • 7
    • 0031272681 scopus 로고    scopus 로고
    • Rollout algorithms for combinatorial optimization
    • D.P. Bertsekas, J.N. Tsitsiklis, C. Wu, Rollout algorithms for combinatorial optimization. Heuristics, 3, 245-262 (1997)
    • (1997) Heuristics , vol.3 , pp. 245-262
    • Bertsekas, D.P.1    Tsitsiklis, J.N.2    Wu, C.3
  • 8
    • 0042941959 scopus 로고    scopus 로고
    • Revenue management in a dynamic network environment
    • D. Bertsimas, I. Popescu, Revenue management in a dynamic network environment. Transp. Sci. 37, 257-277 (2003)
    • (2003) Transp. Sci. , vol.37 , pp. 257-277
    • Bertsimas, D.1    Popescu, I.2
  • 10
    • 3543128853 scopus 로고    scopus 로고
    • Parallel rollout for online solution of partially observable Markov decision processes
    • H.S. Chang, R.L. Givan, E.K.P. Chong, Parallel rollout for online solution of partially observable Markov decision processes. Discret. Event Dyn. Syst. 14, 309-341 (2004)
    • (2004) Discret. Event Dyn. Syst. , vol.14 , pp. 309-341
    • Chang, H.S.1    Givan, R.L.2    Chong, E.K.P.3
  • 12
    • 0033209567 scopus 로고    scopus 로고
    • The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
    • C. Duin, S. Voss, The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs. Networks, 34, 181-191 (1999)
    • (1999) Networks , vol.34 , pp. 181-191
    • Duin, C.1    Voss, S.2
  • 14
    • 33645387176 scopus 로고    scopus 로고
    • Fractionation in radiation treatment planning
    • M.C. Ferris, M.M. Voelker, Fractionation in radiation treatment planning. Math. Program. B 102, 387-413 (2004)
    • (2004) Math. Program. B , vol.102 , pp. 387-413
    • Ferris, M.C.1    Voelker, M.M.2
  • 15
    • 0038216607 scopus 로고    scopus 로고
    • A cooperative parallel rollout algorithm for the sequential ordering problem
    • F. Guerriero, M. Mancini, A cooperative parallel rollout algorithm for the sequential ordering problem. Parallel Comput. 29, 663-677 (2003)
    • (2003) Parallel Comput. , vol.29 , pp. 663-677
    • Guerriero, F.1    Mancini, M.2
  • 16
    • 0036832961 scopus 로고    scopus 로고
    • Building a basic building block scheduler using reinforcement learning and rollouts
    • A. McGovern, E. Moss, A. Barto, Building a basic building block scheduler using reinforcement learning and rollouts. Mach. Learn. 49, 141-160 (2002)
    • (2002) Mach. Learn. , vol.49 , pp. 141-160
    • McGovern, A.1    Moss, E.2    Barto, A.3
  • 17
    • 4444334393 scopus 로고    scopus 로고
    • A rollout metaheuristic for job shop scheduling problems
    • C. Meloni, D. Pacciarelli, M. Pranzo, A rollout metaheuristic for job shop scheduling problems. Ann. Oper. Res. 131, 215-235 (2004)
    • (2004) Ann. Oper. Res. , vol.131 , pp. 215-235
    • Meloni, C.1    Pacciarelli, D.2    Pranzo, M.3
  • 18
    • 0004286550 scopus 로고
    • (Addison-Wesley, Reading)
    • J. Pearl, Heuristics (Addison-Wesley, Reading, 1984)
    • (1984) Heuristics
    • Pearl, J.1
  • 20
    • 0034086424 scopus 로고    scopus 로고
    • Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
    • N. Secomandi, Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 27, 1201-1225 (2000)
    • (2000) Comput. Oper. Res. , vol.27 , pp. 1201-1225
    • Secomandi, N.1
  • 21
    • 0035463693 scopus 로고    scopus 로고
    • A rollout policy for the vehicle routing problem with stochastic demands
    • N. Secomandi, A rollout policy for the vehicle routing problem with stochastic demands. Oper. Res. 49, 796-802 (2001)
    • (2001) Oper. Res. , vol.49 , pp. 796-802
    • Secomandi, N.1
  • 22
    • 0142157191 scopus 로고    scopus 로고
    • Analysis of a rollout approach to sequencing problems with stochastic routing applications
    • N. Secomandi, Analysis of a rollout approach to sequencing problems with stochastic routing applications. J. Heuristics, 9, 321-352 (2003)
    • (2003) J. Heuristics , vol.9 , pp. 321-352
    • Secomandi, N.1
  • 23
    • 54849146900 scopus 로고    scopus 로고
    • Optimization of joint replacement policies for multipart systems by a rollout framework
    • T. Sun, Q. Zhao, R Lun, R. Tomastik, Optimization of joint replacement policies for multipart systems by a rollout framework. IEEE Trans. Autom. Sci. Eng. 5, 609-619 (2008)
    • (2008) IEEE Trans. Autom. Sci. Eng. , vol.5 , pp. 609-619
    • Sun, T.1    Zhao, Q.2    Lun, R.3    Tomastik, R.4
  • 24
    • 84898992015 scopus 로고    scopus 로고
    • On-line policy improvement using Monte Carlo search. Presented at the 1996 neural information processing systems conference, Denver, CO, 1996
    • ed. by M. Mozer et al. (MIT)
    • G. Tesauro, G.R. Galperin, On-line policy improvement using Monte Carlo search. Presented at the 1996 neural information processing systems conference, Denver, CO, 1996; also in Advances in Neural Information Processing Systems 9, ed. by M. Mozer et al. (MIT, 1997)
    • (1997) Advances in Neural Information Processing Systems 9
    • Tesauro, G.1    Galperin, G.R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.