{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/26270"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/26270","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Efficient selection of a set of good enough designs with complexity preference","abstract":"This thesis briefly reviews the important methods involved in solving the best design selection problem in the discrete-event system simulation. The selection of one or several best designs is a common problem people meet in real situations. The research originally focused on the one best design selection problem, the two-stage procedure. Later, there was literature about multiple designs selection problems which are useful in the global optimization as well. Most recently, some researchers have studied the problem of selecting one simplest sufficiently good design applicable to the node activation rule in the wireless sensor networks. However, the problem for selecting several simplest good enough designs is still open for consideration. The second part of the thesis introduces two new algorithms for solving the selection problem related to the designs mentioned above. These two algorithms OCBA-mSG and OCBA-bSG allocate the simulation budget efficiently to identify a subset of m simplest and good enough designs among a total of K (K > m) designs. The numerical results show that both OCBA-mSG and OCBA-bSG outperform some other approaches on the test problems.","abstract_html":"This thesis briefly reviews the important methods involved in solving the best design selection problem in the discrete-event system simulation. The selection of one or several best designs is a common problem people meet in real situations. The research originally focused on the one best design selection problem, the two-stage procedure. Later, there was literature about multiple designs selection problems which are useful in the global optimization as well. Most recently, some researchers have studied the problem of selecting one simplest sufficiently good design applicable to the node activation rule in the wireless sensor networks. However, the problem for selecting several simplest good enough designs is still open for consideration. The second part of the thesis introduces two new algorithms for solving the selection problem related to the designs mentioned above. These two algorithms OCBA-mSG and OCBA-bSG allocate the simulation budget efficiently to identify a subset of m simplest and good enough designs among a total of K (K > m) designs. The numerical results show that both OCBA-mSG and OCBA-bSG outperform some other approaches on the test problems.","abstract_has_math":false,"creators":["Yan, Shen"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Industrial Engineering","degree_department":null,"school":null,"contributors":["Zhou, Enlu"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-08-26T15:20:38Z","date_published":"2011-08-26T15:20:38Z","updated_at":"2026-07-22T22:25:26Z","subjects":["discrete-event system simulation","best design selection problem","Optimal Computing Budget Allocation"],"languages":["en"],"rights":["Copyright 2011 Shen Yan"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/26270","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Zhou, Enlu"]},{"key":"dc:creator","label":"Author","values":["Yan, Shen"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-08-26T15:20:38Z","2013-08-27T10:00:17Z","2011-08"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Industrial Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["discrete-event system simulation","best design selection problem","Optimal Computing Budget Allocation"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2011 Shen Yan"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/26270"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This thesis briefly reviews the important methods involved in solving the best design selection problem in the discrete-event system simulation. The selection of one or several best designs is a common problem people meet in real situations. The research originally focused on the one best design selection problem, the two-stage procedure. Later, there was literature about multiple designs selection problems which are useful in the global optimization as well. Most recently, some researchers have studied the problem of selecting one simplest sufficiently good design applicable to the node activation rule in the wireless sensor networks. However, the problem for selecting several simplest good enough designs is still open for consideration. The second part of the thesis introduces two new algorithms for solving the selection problem related to the designs mentioned above. These two algorithms OCBA-mSG and OCBA-bSG allocate the simulation budget efficiently to identify a subset of m simplest and good enough designs among a total of K (K > m) designs. The numerical results show that both OCBA-mSG and OCBA-bSG outperform some other approaches on the test problems.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-06-30T21:51:48Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 yan_shen.pdf: 780448 bytes, checksum: c17b45751d6302825b816ef88f33068d (MD5)","Made available in DSpace on 2011-08-26T15:20:38Z (GMT). No. of bitstreams: 2 yan_shen.pdf: 780448 bytes, checksum: c17b45751d6302825b816ef88f33068d (MD5) license.txt: 4058 bytes, checksum: 75174e506051beddb6558b373c3cfedb (MD5)","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by William Ingram (wingram2@illinois.edu) on 2011-08-26T15:25:29Z Item is restricted until 2013-08-26T15:25:28Z","Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2013-08-27T10:00:16Z Item was in collections: University of Illinois Dissertations and Theses (ID: 204) Dissertations and Theses - Industrial and Enterprise Systems Engineering (ID: 752) No. of bitstreams: 2 yan_shen.pdf: 780448 bytes, checksum: c17b45751d6302825b816ef88f33068d (MD5) license.txt: 4058 bytes, checksum: 75174e506051beddb6558b373c3cfedb (MD5)","Item released from any restrictions by Sarah Shreeves (sshreeve@illinois.edu) on 2013-08-27T10:00:17Z"]},{"key":"dc:title","label":"Title","values":["Efficient selection of a set of good enough designs with complexity preference"]}]}],"canonical_facts":{"dc:contributor":["Zhou, Enlu"],"dc:creator":["Yan, Shen"],"dc:date":["2011-08-26T15:20:38Z","2013-08-27T10:00:17Z","2011-08"],"dc:description":["This thesis briefly reviews the important methods involved in solving the best design selection problem in the discrete-event system simulation. The selection of one or several best designs is a common problem people meet in real situations. The research originally focused on the one best design selection problem, the two-stage procedure. Later, there was literature about multiple designs selection problems which are useful in the global optimization as well. Most recently, some researchers have studied the problem of selecting one simplest sufficiently good design applicable to the node activation rule in the wireless sensor networks. However, the problem for selecting several simplest good enough designs is still open for consideration. The second part of the thesis introduces two new algorithms for solving the selection problem related to the designs mentioned above. These two algorithms OCBA-mSG and OCBA-bSG allocate the simulation budget efficiently to identify a subset of m simplest and good enough designs among a total of K (K > m) designs. The numerical results show that both OCBA-mSG and OCBA-bSG outperform some other approaches on the test problems.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-06-30T21:51:48Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 yan_shen.pdf: 780448 bytes, checksum: c17b45751d6302825b816ef88f33068d (MD5)","Made available in DSpace on 2011-08-26T15:20:38Z (GMT). No. of bitstreams: 2 yan_shen.pdf: 780448 bytes, checksum: c17b45751d6302825b816ef88f33068d (MD5) license.txt: 4058 bytes, checksum: 75174e506051beddb6558b373c3cfedb (MD5)","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by William Ingram (wingram2@illinois.edu) on 2011-08-26T15:25:29Z Item is restricted until 2013-08-26T15:25:28Z","Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2013-08-27T10:00:16Z Item was in collections: University of Illinois Dissertations and Theses (ID: 204) Dissertations and Theses - Industrial and Enterprise Systems Engineering (ID: 752) No. of bitstreams: 2 yan_shen.pdf: 780448 bytes, checksum: c17b45751d6302825b816ef88f33068d (MD5) license.txt: 4058 bytes, checksum: 75174e506051beddb6558b373c3cfedb (MD5)","Item released from any restrictions by Sarah Shreeves (sshreeve@illinois.edu) on 2013-08-27T10:00:17Z"],"dc:identifier":["http://hdl.handle.net/2142/26270"],"dc:language":["en"],"dc:rights":["Copyright 2011 Shen Yan"],"dc:subject":["discrete-event system simulation","best design selection problem","Optimal Computing Budget Allocation"],"dc:title":["Efficient selection of a set of good enough designs with complexity preference"],"thesis:degree_discipline":["Industrial Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:26Z"}