.png){kind=icon}
返回
Multi-objective ordinal optimization for simulation optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2007.03.011.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Ordinal optimization (OO) has been successfully applied to accelerate the simulation optimization process with single objective by quickly narrowing down the search space. In this paper, we extend the OO techniques to address multi-objective simulation optimization problems by using the concept of Pareto optimality. We call this technique the multi-objective OO (MOO). To define the good enough set and the selected set, we introduce two performance indices based on the non-dominance relationship among the designs. Then we derive several lower bounds for the alignment probability under various scenarios by using a Bayesian approach. Numerical experiments show that the lower bounds of the alignment probability are valid when they are used to estimate the size of the selected set as well as the expected alignment level. Though the lower bounds are conservative, they have great practical value in terms of narrowing down the search space. (C) 2007 Elsevier Ltd. All rights reserved.
Keyword:
ordinal optimization
multi-objective simulation optimization
pareto optimality
alignment probability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
暂无机构信息
引用论文
分享收藏Towards safer colonoscopy: a report on the complications of 5000 diagnostic or therapeutic colonoscopies..png)
Gut
OAAI
GutIF0
OAAI分享收藏分享收藏
查看更多内容