{"id":"https://openalex.org/W2143418843","doi":"https://doi.org/10.1109/wsc.2003.1261467","title":"Simulation-based retrospective optimization of stochastic systems: a family of algorithms","display_name":"Simulation-based retrospective optimization of stochastic systems: a family of algorithms","publication_year":2004,"publication_date":"2004-05-13","ids":{"openalex":"https://openalex.org/W2143418843","doi":"https://doi.org/10.1109/wsc.2003.1261467","mag":"2143418843"},"language":"en","primary_location":{"id":"doi:10.1109/wsc.2003.1261467","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc.2003.1261467","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100893329","display_name":"Jiohong Jin","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jiohong Jin","raw_affiliation_strings":["Bolingbrook, IL, USA"],"affiliations":[{"raw_affiliation_string":"Bolingbrook, IL, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108526557","display_name":"B.W. Schmeiser","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"B. Schmeiser","raw_affiliation_strings":["School of Industrial Engineering, Purdue University, West Lafayette, IN, USA"],"affiliations":[{"raw_affiliation_string":"School of Industrial Engineering, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100893329"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.20734783,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"543","last_page":"547"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11918","display_name":"Forecasting Techniques and Applications","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11918","display_name":"Forecasting Techniques and Applications","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11443","display_name":"Advanced Statistical Process Monitoring","score":0.9840999841690063,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10357","display_name":"Efficiency Analysis Using DEA","score":0.9799000024795532,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7741885185241699},{"id":"https://openalex.org/keywords/stochastic-approximation","display_name":"Stochastic approximation","score":0.6743156909942627},{"id":"https://openalex.org/keywords/estimator","display_name":"Estimator","score":0.6551569700241089},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5773233771324158},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.557058572769165},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5429359078407288},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5056869983673096},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.4888693690299988},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.4840502142906189},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.46520715951919556},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.4423671364784241},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43434977531433105},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41418319940567017},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4054965674877167},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.13037610054016113}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7741885185241699},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.6743156909942627},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.6551569700241089},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5773233771324158},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.557058572769165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5429359078407288},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5056869983673096},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.4888693690299988},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.4840502142906189},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.46520715951919556},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.4423671364784241},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43434977531433105},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41418319940567017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4054965674877167},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.13037610054016113},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wsc.2003.1261467","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc.2003.1261467","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.6700000166893005}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W11974643","https://openalex.org/W2073583350","https://openalex.org/W2171934803","https://openalex.org/W2797333853","https://openalex.org/W3018285358","https://openalex.org/W6600490550","https://openalex.org/W6776498154"],"related_works":["https://openalex.org/W1034070228","https://openalex.org/W2124181538","https://openalex.org/W3207830353","https://openalex.org/W2134007003","https://openalex.org/W2019875157","https://openalex.org/W4286899070","https://openalex.org/W1859974437","https://openalex.org/W2110817230","https://openalex.org/W4310831616","https://openalex.org/W4323366756"],"abstract_inverted_index":{"We":[0,50,98],"consider":[1],"optimizing":[2],"a":[3,8,52,60,109],"stochastic":[4],"system,":[5],"given":[6],"only":[7],"simulation":[9],"model":[10,19],"that":[11,100,117],"is":[12,20,76,120],"parameterized":[13],"by":[14,78],"continuous":[15],"decision":[16,96,114],"variables.":[17,97],"The":[18,37,124],"assumed":[21],"to":[22,65,122,133],"produce":[23],"unbiased":[24],"point":[25,80],"estimates":[26],"of":[27,54,62,94,127],"the":[28,43,48,66,95,113,135,145],"system":[29],"performance":[30,38,84],"measure(s),":[31],"which":[32],"must":[33],"be":[34,105],"expected":[35],"values.":[36],"measures":[39],"may":[40],"appear":[41],"in":[42,47,112],"objective":[44],"function":[45],"and/or":[46],"constraints.":[49],"develop":[51],"family":[53],"retrospective-optimization":[55],"(RO)":[56],"algorithms":[57],"based":[58,140],"on":[59,141],"sequence":[61],"sample-path":[63],"approximations":[64],"original":[67],"problem":[68,75,138],"with":[69],"increasing":[70],"sample":[71],"sizes.":[72],"Each":[73],"approximation":[74,102,137,148],"obtained":[77],"substituting":[79],"estimators":[81],"for":[82],"each":[83],"measure":[85],"and":[86,116],"using":[87],"common":[88],"random":[89],"numbers":[90],"over":[91],"all":[92],"values":[93],"assume":[99],"these":[101],"problems":[103],"can":[104],"deterministically":[106],"solved":[107],"within":[108],"specified":[110],"error":[111,119],"variables,":[115],"this":[118],"decreasing":[121],"zero.":[123],"computational":[125],"efficiency":[126],"RO":[128],"arises":[129],"from":[130,144],"being":[131],"able":[132],"solve":[134],"next":[136],"efficiently":[139],"knowledge":[142],"gained":[143],"earlier,":[146],"easier":[147],"problems.":[149]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}