{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T02:09:32Z","timestamp":1674526172403},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Comput. Simul."],"published-print":{"date-parts":[[2006,10]]},"abstract":"This article is concerned with proving the almost sure and global convergence of a broad class of algorithms for solving simulation optimization problems with countably infinite number of feasible points. We first describe the class of simulation optimization algorithms under consideration and discuss how the estimate of the optimal solution should be chosen when the feasible region of the underlying optimization problem is countably infinite. Then, we present a general result that guarantees the global convergence with probability one of the simulation optimization algorithms in this class. The assumptions of this result are sufficiently weak to allow the algorithms under consideration to be efficient, in that they are not required to either allocate the same amount of computer effort to all the feasible points these algorithms visit, or to spend an increasing amount of computer effort per iteration as the number of iterations grows. This article concludes with a discussion of how our assumptions can be satisfied and also generalized.<\/jats:p>","DOI":"10.1145\/1176249.1176252","type":"journal-article","created":{"date-parts":[[2007,1,16]],"date-time":"2007-01-16T19:38:29Z","timestamp":1168976309000},"page":"357-374","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Simulation optimization with countably infinite feasible regions"],"prefix":"10.1145","volume":"16","author":[{"given":"Sigr\u00fan","family":"Andrad\u00f3ttir","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA"}]}],"member":"320","published-online":{"date-parts":[[2006,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.2307\/1427934","article-title":"Sample mean based index policies with o(log n) regret for the multi-armed bandit problem","volume":"27","author":"Agrawal R.","year":"1995","journal-title":"Adv. Appl. Prob."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.45.5.748"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/S0377-2217(00)00190-9","article-title":"A modification of the stochastic ruler method for discrete stochastic optimization","volume":"133","author":"Alrefaei M. H.","year":"2001","journal-title":"Europ. J. Operat. Res."},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1002\/nav.20080","article-title":"Discrete stochastic optimization using variants of the stochastic ruler method","volume":"52","author":"Alrefaei M. H.","year":"2005","journal-title":"Naval Res. Log."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.41.12.1946"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1137\/0806027","article-title":"A global search method for discrete stochastic optimization","volume":"6","author":"Andrad\u00f3ttir S.","year":"1996","journal-title":"SIAM J. Optim."},{"key":"e_1_2_1_7_1","volume-title":"Handbook of Simulation: Principles, Methodology, Advances, Applications, and Practice","author":"Andrad\u00f3ttir S."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/352222.352225"},{"key":"e_1_2_1_10_1","unstructured":"Dembo A. and Zeitouni O. 1993. Large Deviations Techniques and Applications. Jones and Bartlett Boston MA. Dembo A. and Zeitouni O. 1993. Large Deviations Techniques and Applications. Jones and Bartlett Boston MA."},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1109\/TSMC.1976.5408782","article-title":"Probabilistic search as a strategy selection procedure","volume":"6","author":"Devroye L.","year":"1976","journal-title":"IEEE Trans. Syst., Man, Cyber."},{"key":"e_1_2_1_12_1","volume-title":"Probability: Theory and Examples","author":"Durrett R.","year":"1991"},{"key":"e_1_2_1_13_1","first-page":"1087","article-title":"Probabilistic search with overrides","volume":"6","author":"Fox B. L.","year":"1996","journal-title":"Ann. Appl. Probab."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.14.3.192.113"},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF00939629","article-title":"Simulated annealing with noisy or imprecise energy measurements","volume":"62","author":"Gelfand S. B.","year":"1989","journal-title":"J. Optim. Theory Appl."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623495290684"},{"key":"e_1_2_1_17_1","unstructured":"Grimmett G. R. and D. R. Stirzaker. 1992. Probability and Random Processes 2nd ed. Oxford University Press Oxford UK. Grimmett G. R. and D. R. Stirzaker. 1992. Probability and Random Processes 2nd ed. Oxford University Press Oxford UK."},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00229298","article-title":"Simulated annealing for noisy cost functions","volume":"8","author":"Gutjahr W. J.","year":"1996","journal-title":"J. Global Optim."},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01797280","article-title":"Ordinal optimization of DEDS","volume":"2","author":"Ho Y. C.","year":"1992","journal-title":"J. Disc. Event Dynam. Syst."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/858481.858483"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1050.0237"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/502109.502111"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499363220"},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/0196-8858(85)90002-8","article-title":"Asymptotically efficient adaptive allocation rules","volume":"6","author":"Lai T. L.","year":"1985","journal-title":"Adv. Appl. Math."},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1137\/S0040585X9798004X","article-title":"Moment inequalities for sums of certain dependent random variables","volume":"47","author":"Louhichi S.","year":"2003","journal-title":"Theory Prob. Appl."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.49.6.950.10019"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02680569"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/858481.858485"},{"key":"e_1_2_1_29_1","unstructured":"Prudius A. A. and Andrad\u00f3ttir S. 2006. Balanced explorative and exploitative search with estimation. Submitted for publication. Prudius A. A. and Andrad\u00f3ttir S. 2006. Balanced explorative and exploitative search with estimation. Submitted for publication."},{"key":"e_1_2_1_30_1","unstructured":"R\u00e9v\u00e9sz P. 1968. The Laws of Large Numbers. Academic Press New York. R\u00e9v\u00e9sz P. 1968. The Laws of Large Numbers. Academic Press New York."},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/A:1010081212560","article-title":"Nested partitions method for stochastic optimization","volume":"2","author":"Shi L.","year":"2000","journal-title":"Method. Comput. Appl. Prob."},{"key":"e_1_2_1_32_1","unstructured":"Stout W. F. 1974. Almost Sure Convergence. Academic Press New York. Stout W. F. 1974. Almost Sure Convergence. Academic Press New York."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/0911041"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02055587"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0330034"}],"container-title":["ACM Transactions on Modeling and Computer Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1176249.1176252","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T20:09:57Z","timestamp":1672258197000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1176249.1176252"}},"subtitle":["Efficiency and convergence"],"short-title":[],"issued":{"date-parts":[[2006,10]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["10.1145\/1176249.1176252"],"URL":"http:\/\/dx.doi.org\/10.1145\/1176249.1176252","relation":{},"ISSN":["1049-3301","1558-1195"],"issn-type":[{"value":"1049-3301","type":"print"},{"value":"1558-1195","type":"electronic"}],"subject":["Computer Science Applications","Modeling and Simulation"],"published":{"date-parts":[[2006,10]]},"assertion":[{"value":"2006-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}