TY - JOUR
T1 - A Heuristic Approach for Selecting Best-Subset including Ranking within the Subset
AU - Choi, Seon Han
AU - Kim, Tag Gon
N1 - Funding Information:
Manuscript received October 30, 2017; revised February 12, 2018; accepted September 11, 2018. Date of publication October 3, 2018; date of current version September 16, 2020. This work was supported in part by the “Development Platform for User-Level Customizable, General Purpose Discrete Event Simulation Software” through the Institute for Information and Communications Technology Promotion funded by the Korea Government under Grant 2017-0-00461, and in part by the Brain Korea 21 PLUS Program. This paper was recommended by Associate Editor M. P. Fanti. (Corresponding author: Seon Han Choi.) S. H. Choi is with the Industrial Convergence Infrastructure Office, Korea Institute of Industrial Technology, Ansan 15588, South Korea (e-mail: gigohan01@kaist.ac.kr).
Publisher Copyright:
© 2013 IEEE.
PY - 2020/10
Y1 - 2020/10
N2 - Stochastic simulation is beneficial when evaluating the performance of a complex system. When optimizing the system performance with the simulation, we need to make a final decision by considering various qualitative criteria neglected by the simulation as well as the simulation results. However, as simulations are expensive and time-consuming, in this paper, we propose a ranking and selection algorithm to make such optimization with the simulation efficient. The proposed algorithm selects a best-subset of designs expected to optimize the system performance from a finite set of alternatives. Furthermore, the algorithm identifies the ranking of designs within the subset. To maximize the accuracy of the selection under limited simulation resources, the algorithm selectively and gradually increases the precision of the sample mean of each design by allocating the resources heuristically based on the evaluated uncertainty. The selected subset allows decision makers to efficiently choose the best design that optimizes the performance while satisfying the qualitative criteria. We exhibit various experimental results, including a practical case study, to empirically demonstrate the efficiency and high noise robustness of the proposed algorithm.
AB - Stochastic simulation is beneficial when evaluating the performance of a complex system. When optimizing the system performance with the simulation, we need to make a final decision by considering various qualitative criteria neglected by the simulation as well as the simulation results. However, as simulations are expensive and time-consuming, in this paper, we propose a ranking and selection algorithm to make such optimization with the simulation efficient. The proposed algorithm selects a best-subset of designs expected to optimize the system performance from a finite set of alternatives. Furthermore, the algorithm identifies the ranking of designs within the subset. To maximize the accuracy of the selection under limited simulation resources, the algorithm selectively and gradually increases the precision of the sample mean of each design by allocating the resources heuristically based on the evaluated uncertainty. The selected subset allows decision makers to efficiently choose the best design that optimizes the performance while satisfying the qualitative criteria. We exhibit various experimental results, including a practical case study, to empirically demonstrate the efficiency and high noise robustness of the proposed algorithm.
KW - Best-subset selection
KW - ranking and selection (R&S)
KW - ranking identification
KW - stochastic simulation
KW - system performance optimization
UR - http://www.scopus.com/inward/record.url?scp=85054534054&partnerID=8YFLogxK
U2 - 10.1109/TSMC.2018.2870408
DO - 10.1109/TSMC.2018.2870408
M3 - Article
AN - SCOPUS:85054534054
SN - 2168-2216
VL - 50
SP - 3852
EP - 3862
JO - IEEE Transactions on Systems, Man, and Cybernetics: Systems
JF - IEEE Transactions on Systems, Man, and Cybernetics: Systems
IS - 10
M1 - 8480451
ER -