Simulation Budget Allocation for Further Enhancing theEfficiency of Ordinal Optimization
Discrete Event Dynamic Systems
Dynamic node activation in networks of rechargeable sensors
IEEE/ACM Transactions on Networking (TON)
Analysis methodology: are we done?
WSC '05 Proceedings of the 37th conference on Winter simulation
A new perspective on feasibility determination
Proceedings of the 40th Conference on Winter Simulation
| Hi-index | 0.00 |
Simple designs have many advantages compared with complex designs, such as requiring less computing and memory resources, and easier to interpret and to implement. Therefore, they are usually more preferable than complex designs in the real world if their performances are within a good enough range. In this paper, we propose an algorithm OCBA-bSG to identify a best subset of m simplest and good enough designs among K (K m) total designs. The numerical results show that our approach allocates the simulation budget efficiently, and outperforms some other approaches on the test problems.