Approximately Optimal Computing-Budget Allocation for subset ranking
JunQi Zhang, ZeZhou Li, Cheng Wang, Di Zang, MengChu Zhou
Abstract
The best design among many can be selected through their accurate performance evaluation. When such evaluation is based on discrete event simulations, the design selection is extremely time-consuming. Ordinal optimization greatly speeds up this process. Optimal Computing-Budget Allocation (OCBA) has further accelerated it. Other kinds of OCBA have been introduced for reaching different goals, for example, to select the optimal subset of designs. However, facing the issue of subset ranking, which is a generalized form from problems selecting the best design or optimal subset, all the existing ones are insufficient. This work develops a new OCBA-based approach to address this subset ranking issue. Through mathematical deduction, its theoretical foundation is laid. Our numerical simulation results reveal that it indeed outperforms all the other existing methods in terms of probability of correct subset ranking and computational efficiency.
BibTeX
@inproceedings{icra2015_approximatelyopt,
title = {Approximately Optimal Computing-Budget Allocation for subset ranking},
author = {JunQi Zhang and ZeZhou Li and Cheng Wang and Di Zang and MengChu Zhou},
booktitle = {ICRA 2015},
year = {2015}
}