A Heuristic Approach for Selecting Best-Subset Including Ranking Within the Subset
- 주제(키워드) Uncertainty , Computational modeling , Nickel , Resource management , System performance , Simulation , Genetic algorithms , Best-subset selection , ranking and selection (R&S) , ranking identification , stochastic simulation , system performance optimization
- 주제(기타) Automation & Control Systems, Computer Science
- 설명문(URI) https://www.webofscience.com/wos/woscc/full-record/WOS:000571736100032
- 등재 SCIE, SCOPUS
- 발행기관 IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- 발행년도 2020
- URI http://www.dcollection.net/handler/ewha/000000185410
- 본문언어 영어
- Published As https://doi.org/10.1109/TSMC.2018.2870408
- 저작권 이화여자대학교 논문은 저작권에 의해 보호받습니다.
초록/요약
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.
more