.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
ordinal optimization
multi-objective simulation optimization
pareto optimality
alignment probability
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSaveShareSaveTowards safer colonoscopy: a report on the complications of 5000 diagnostic or therapeutic colonoscopies..png)
Gut
OAAI
GutIF0
OAAIShareSaveShareSave
View more