Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.automatica.2007.03.011 | Automatica |
Keywords | Field | DocType |
Ordinal optimization,Multi-objective simulation optimization,Pareto optimality,Alignment probability | Mathematical optimization,Upper and lower bounds,Alignment level,Multiobjective programming,Single objective,Ordinal optimization,Optimization problem,Pareto principle,Mathematics,Bayesian probability | Journal |
Volume | Issue | ISSN |
43 | 11 | Automatica |
Citations | PageRank | References |
12 | 0.60 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Suyan Teng | 1 | 113 | 6.92 |
| Loo Hay Lee | 2 | 1159 | 93.96 |
| Ek Peng Chew | 3 | 459 | 44.07 |