Finding the non-dominated Pareto set for multi-objective simulation models
Lee, L.H. Chew, E.P. Teng, S. Goldsman, D.
Goldsman, D.
Citations
Altmetric:
Alternative Title
Abstract
This article considers a multi-objective Ranking and Selection (R+S) problem, where the system designs are evaluated in terms of more than one performance measure. The concept of Pareto optimality is incorporated into the R+S scheme, and attempts are made to find all of the non-dominated designs rather than a single best one. In addition to a performance index to measure how non-dominated a design is, two types of errors are defined to measure the probabilities that designs in the true Pareto/non-Pareto sets are dominated/non-dominated based on observed performance. Asymptotic allocation rules are derived for simulation replications based on a Lagrangian relaxation method, under the assumption that an arbitrarily large simulation budget is available. Finally, a simple sequential procedure is proposed to allocate the simulation replications based on the asymptotic allocation rules. Computational results show that the proposed solution framework is efficient when compared to several other algorithms in terms of its capability of identifying the Pareto set. Copyright © "IIE".
Keywords
Lagrangian relaxation, Multi-objective simulation, Optimal computing budget allocation, Pareto optimality
Source Title
IIE Transactions (Institute of Industrial Engineers)
Publisher
Series/Report No.
Collections
Rights
Date
2010-09
DOI
10.1080/07408171003705367
Type
Article