ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Finding the pareto set for multi-objective simulation models by minimization of expected opportunity cost
Full text PdfPdf (211 KB)
Source Winter Simulation Conference archive
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come table of contents
Washington D.C.
SESSION: Analysis methodology B: recent advances in optimization and analysis table of contents
Pages: 513-521  
Year of Publication: 2007
ISBN:1-4244-1306-0
Authors
Loo Hay Lee  National University of Singapore, Singapore
Ek Peng Chew  National University of Singapore, Singapore
Suyan Teng  National University of Singapore, Singapore
Sponsors
INFORMS-SIM : Institute for Operations Research and the Management Sciences: Simulation Society
NIST : National Institute of Standards and Technology
(SCS) : The Society for Modeling and Simulation International
ACM/SIGSIM : Association for Computing Machinery: Special Interest Group on Simulation
IIE : Institute of Industrial Engineers
ASA : American Statistical Association
IEEE/SMC : Institute of Electrical and Electronics Engineers: Systems, Man, and Cybernetics Society
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 22,   Citation Count: 1
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

In this study, we mainly explore how to optimally allocate the computing budget for a multi-objective ranking and selection (MORS) problem when the measure of selection quality is the expected opportunity cost (OC). We define OC incurred to both the observed Pareto and non-Pareto set, and present a sequential procedure to allocate the replications among the designs according to some asymptotic allocation rules. Numerical analysis shows that the proposed solution framework works well when compared with other algorithms in terms of its capability of identifying the true Pareto set.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
Chen, E. J. and Kelton, W. D. (2004) Sequential selection procedures: Using sample means to improve efficiency. European Journal of Operational Research,
 
4
Chen, H. C., Chen C. H. and Yücesan, E. (2000) Computing Efforts Allocation for Ordinal Optimization and Discrete Event Simulation. IEEE Transactions on Automatic Control, 45 (5), 960--964.
 
5
 
6
 
7
DeGroot, M. H. 1970. Optimal Statistical Decisions. McGraw-Hill, Inc.
 
8
 
9
He, D., Chick, S. E., and Chen, C. H. (2006). The opportunity cost and OCBA selection procedures in ordinal optimization. Submitted for publication.
 
10
 
11
Lee, L. H., Chew, E. P., Teng, S. Y. and Goldsman, D. (2006). Optimal computing budget allocation for multi-objective simulation models. Submitted to IIE Transactions.
 
12
 
13
Rinott, Y. (1978) On two-stage selection procedures and related probability-inequalities. Communications in Statistics, A7 (8), 799--811.
14

Collaborative Colleagues:
Loo Hay Lee: colleagues
Ek Peng Chew: colleagues
Suyan Teng: colleagues