.png){kind=icon}
返回
Optimal computing budget allocation for selecting the optimal subset of multi-objective simulation optimization problems☆
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2024.111829.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This study aims to develop an efficient budget allocation procedure for the problem of selecting an optimal subset of designs from a finite number of alternative designs in stochastic environments. The optimal subset might contain more alternative designs beyond the Pareto optimal ones. In this study, we adopt the Pareto rank to measure the performance of each design and define the optimal subset. Our objective is to minimize the probability that the optimal subset is falsely selected within a fixed limited simulation budget. We propose an upper bound of the probability of false selection and derive an asymptotically optimal simulation budget allocation rule based on the large deviation theory. We also provide some useful insights into how the simulation budget can be allocated to identify the optimal subset. The proposed budget allocation algorithm is compared with existing methods through numerical experiments, and the results show the efficiency of our proposed algorithm. (c) 2024 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
Keyword:
Available online xxxx
OCBA
Simulation optimization
Multi-objective optimization
Ranking and selection
Subset selection
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
分享收藏
Optimal computing budget allocation for the vector evaluated genetic algorithm in multi-objective simulation optimization多目标仿真优化中向量评价遗传算法的最优计算预算分配.png)
AUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAI分享收藏Automated multi-objective system identification using grammar-based genetic programmingAUTOMATICAOAAI
AUTOMATICAIF5.9
OAAI分享收藏
查看更多内容