More Web Proxy on the site http://driver.im/

research-article

A note on the subset selection for simulation optimization

Authors:

Weiwei ChenAuthors Info & Claims

WSC '15: Proceedings of the 2015 Winter Simulation Conference

Pages 3768 - 3776

Published: 06 December 2015 Publication History

Abstract

In this paper, we consider the problem of selecting an optimal subset from a finite set of simulated designs. Using the optimal computing budget allocation (OCBA) framework, we formulate the problem as that of maximizing the probability of correctly selecting the top m designs subject to a constraint on the total number of samples available. For an approximation of the probability of correct selection, we derive an asymptotically optimal subset selection procedure that is easy to implement. More importantly, we provide some useful insights on characterizing an efficient subset selection rule and how it can be achieved by adjusting the budgets allocated to the optimal and non-optimal subsets.

References

[1]

Boyd, S., and L. Vandenberghe. 2004. Convex Optimization. New York: Cambridge University Press.

Digital Library

[2]

Branke, J., S. E. Chick, and C. Schmidt. 2007. "Selecting a selection procedure". Management Science 53 (11): 1916--1932.

Digital Library

[3]

Chambers, L. 1995. Practical Handbook of Genetic Algorithms. CRC Press.

Digital Library

[4]

Chen, C. H., D. He, M. Fu, and L. H. Lee. 2008. "Efficient simulation budget allocation for selecting an optimal subset". Informs Journal on Computing 20 (4): 579--595.

[5]

Chen, C. H., and L. H. Lee. 2011. Stochastic Simulation Optimization: An Optimal Computing Budget Allocation. Singapore: World Scientific Publishing.

Digital Library

[6]

Chen, C. H., J. Lin, E. Yücesan, and S. E. Chick. 2000. "Simulation budget allocation for further enhancing the efficiency of ordinal optimization". Discrete Event Dynamic Systems 10:251--270.

Digital Library

[7]

Chick, S. E., and K. Inoue. 2001a. "New procedures for identifying the best simulated system using common random numbers". Management Science 47 (8): 1133--1149.

Digital Library

[8]

Chick, S. E., and K. Inoue. 2001b. "New two-stage and sequential procedures for selecting the best simulated system". Operations Research 49 (5): 732--743.

Digital Library

[9]

Dudewicz, E. J., and S. R. Dalal. 1975. "Allocation of observations in ranking and selection with unequal variances". Sankhya 37B:28--78.

[10]

Frazier, P. I., W. B. Powerll, and S. Dayanik. 2008. "A knowledge-gradient policy for sequential information collection". SIAM Journal on Control and Optimization 47:2410--2439.

Digital Library

[11]

Frazier, P. I., W. B. Powerll, and S. Dayanik. 2009. "The knowledge-gradient policy for correlated normal beliefs". Informs Journal on Computing 21:599--613.

[12]

Gao, S., and W. Chen. 2015. "Efficient subset selection for the expected opportunity cost". Automatica to appear.

Digital Library

[13]

Gao, S., and L. Shi. 2015a. "A new budget allocation framework for the expected opportunity cost". submitted.

[14]

Gao, S., and L. Shi. 2015b. "Selecting the best simulated design with the expected opportunity cost bound". IEEE Transactions on Automatic Control to appear.

[15]

Hu, J., M. C. Fu, and S. I. Marcus. 2007. "A model reference adaptive search method for global optimization". Operations Research 55 (3): 549--568.

Digital Library

[16]

Hu, J., M. C. Fu, and S. I. Marcus. 2008. "A model reference adaptive search method for stochastic global optimization". Communications in Information and Systems 8 (3): 245--276.

[17]

Kim, S. H., and B. L. Nelson. 2001. "A fully sequential procedure for indifference-zone selection in simulation". ACM Transactions on Modeling and Computer Simulation 11 (3): 251--273.

Digital Library

[18]

Kim, S. H., and B. L. Nelson. 2007. "Recent advances in ranking and selection". In Proceedings of the 2007 Winter Simulation Conference, 162--172. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers, Inc.

Digital Library

[19]

Koenig, L. W., and A. M. Law. 1985. "A procedure for selecting a subset of size m containing the l best of k independent normal populations, with applications to simulation". Communication in Statistics-Simulation and Computation 14 (3): 719--734.

[20]

Nelson, B. L., J. Swann, D. Goldsman, and W. Song. 2001. "Simple procedures for selecting the best simulated system when the number of alternatives is large". Operations Research 49 (6): 950--963.

Digital Library

[21]

Rinott, Y. 1978. "On two-stage selection procedures and related probability inequalities". Communications in Statistics A7 (8): 799--811.

[22]

Rubinstein, R. Y., and D. P. Kroese. 2004. The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning. Springer.

Digital Library

Cited By

Zhang GPeng YZhang JZhou E(2021)Dynamic sampling policy for subset selectionProceedings of the Winter Simulation Conference10.5555/3522802.3522957(1-12)Online publication date: 13-Dec-2021
https://dl.acm.org/doi/10.5555/3522802.3522957
Monks TCurrie CJohansson BJain S(2018)Practical considerations in selecting the best set of simulated systemsProceedings of the 2018 Winter Simulation Conference10.5555/3320516.3320779(2191-2200)Online publication date: 9-Dec-2018
https://dl.acm.org/doi/10.5555/3320516.3320779

Recommendations

Optimal computing budget allocation for selecting the optimal subset of multi-objective simulation optimization problems
Abstract
This study aims to develop an efficient budget allocation procedure for the problem of selecting an optimal subset of designs from a finite number of alternative designs in stochastic environments. The optimal subset might contain more ...
COMBSS: best subset selection via continuous optimization
Abstract
The problem of best subset selection in linear regression is considered with the aim to find a fixed size subset of features that best fits the response. This is particularly challenging when the total available number of features is very large ...
Sparsity-Preserved Pareto Optimization for Subset Selection
Subset selection that selects a limited number of variables optimizing many given criteria is a fundamental problem with various applications, such as sparse regression (SR) and unsupervised feature selection (UFS). Among the existing algorithms for ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

WSC '15: Proceedings of the 2015 Winter Simulation Conference

December 2015

4051 pages

ISBN:9781467397414

Sponsors

SIGSIM: ACM Special Interest Group on Simulation and Modeling

Publisher

IEEE Press

Publication History

Published: 06 December 2015

Check for updates

Qualifiers

Research-article

Conference

WSC '15

Sponsor:

SIGSIM

WSC '15: Winter Simulation Conference

December 6 - 9, 2015

California, Huntington Beach

Acceptance Rates

WSC '15 Paper Acceptance Rate 202 of 296 submissions, 68%;

Overall Acceptance Rate 3,413 of 5,075 submissions, 67%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
38
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhang GPeng YZhang JZhou E(2021)Dynamic sampling policy for subset selectionProceedings of the Winter Simulation Conference10.5555/3522802.3522957(1-12)Online publication date: 13-Dec-2021
https://dl.acm.org/doi/10.5555/3522802.3522957
Monks TCurrie CJohansson BJain S(2018)Practical considerations in selecting the best set of simulated systemsProceedings of the 2018 Winter Simulation Conference10.5555/3320516.3320779(2191-2200)Online publication date: 9-Dec-2018
https://dl.acm.org/doi/10.5555/3320516.3320779

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents