Optimal computing budget allocation for Monte Carlo simulation with application to product design

Abstract Ordinal optimization has emerged as an efficient technique for simulation and optimization, converging exponentially in many cases. In this paper, we present a new computing budget allocation approach that further enhances the efficiency of ordinal optimization. Our approach intelligently determines the best allocation of simulation trials or samples necessary to maximize the probability of identifying the optimal ordinal solution. We illustrate the approach’s benefits and ease of use by applying it to two electronic circuit design problems. Numerical results indicate the approach yields significant savings in computation time above and beyond the use of ordinal optimization.

[1]  Jan Ogrodzki,et al.  Circuit Simulation Methods and Algorithms , 1994 .

[2]  Yu-Chi Ho,et al.  Ordinal optimization of DEDS , 1992, Discret. Event Dyn. Syst..

[3]  Chun-Hung Chen,et al.  An effective approach to smartly allocate computing budget for discrete event simulation , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[4]  Weibo Gong,et al.  Stochastic comparison algorithm for discrete optimization with estimation , 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.

[5]  C. Cassandras,et al.  A stochastic comparison algorithm for continuous optimization with estimation , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[6]  M. Degroot Optimal Statistical Decisions , 1970 .

[7]  V. Nollau Kushner, H. J./Clark, D. S., Stochastic Approximation Methods for Constrained and Unconstrained Systems. (Applied Mathematical Sciences 26). Berlin‐Heidelberg‐New York, Springer‐Verlag 1978. X, 261 S., 4 Abb., DM 26,40. US $ 13.20 , 1980 .

[8]  Chun-Hung Chen,et al.  New development of optimal computing budget allocation for discrete event simulation , 1997, WSC '97.

[9]  M. T. Wasan Stochastic Approximation , 1969 .

[10]  Erich Christian,et al.  Filter design tables and graphs , 1966 .

[11]  Chun-Hung Chen,et al.  Simulation Budget Allocation for Further Enhancing the Efficiency of Ordinal Optimization , 2000, Discret. Event Dyn. Syst..

[12]  Christos G. Cassandras,et al.  Descent algorithms for discrete resource allocation problems , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[13]  Chun-Hung Chen,et al.  Ordinal comparison of heuristic algorithms using stochastic optimization , 1999, IEEE Trans. Robotics Autom..

[14]  Chun-Hung Chen A lower bound for the correct subset-selection probability and its application to discrete-event system simulations , 1996, IEEE Trans. Autom. Control..

[15]  Chun-Hung Chen,et al.  SIMD parallel discrete-event dynamic system simulation , 1996, IEEE Trans. Control. Syst. Technol..

[16]  Vijay Kumar,et al.  Motion planning of walking robots using ordinal optimization , 1998, IEEE Robotics Autom. Mag..

[17]  D. Yan,et al.  Optimization algorithm with probabilistic estimation , 1988 .

[18]  L. Dai Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems , 1995 .

[19]  Barry L. Nelson,et al.  Ranking, selection and multiple comparisons in computer simulation , 1994, Proceedings of Winter Simulation Conference.