Simulation optimization using the Particle Swarm Optimization with optimal computing budget allocation

Simulation has been applied in many optimization problems to evaluate their solutions' performance under stochastic environment. For many approaches solving this kind of simulation optimization problems, most of the attention is on the searching mechanism. The computing efficiency problems are seldom considered and computing replications are usually equally allocated to solutions. In this paper, we integrate the notion of optimal computing budget allocation (OCBA) into a simulation optimization approach, Particle Swarm Optimization (PSO), to improve the efficiency of PSO. The computing budget allocation models for two versions of PSO are built and two allocation rules PSOs_OCBA and PSObw_OCBA are derived by some approximations. The numerical result shows the computational efficiency of PSO can be improved by applying these two allocation rules.

[1]  Leyuan Shi,et al.  An integrated framework for deterministic and stochastic optimization , 1997, WSC '97.

[2]  Peter W. Glynn,et al.  A large deviations perspective on ordinal optimization , 2004, Proceedings of the 2004 Winter Simulation Conference, 2004..

[3]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[4]  Chukwudi Anyakoha,et al.  A review of particle swarm optimization. Part I: background and development , 2007, Natural Computing.

[5]  Ling Wang,et al.  Particle swarm optimization for function optimization in noisy environment , 2006, Appl. Math. Comput..

[6]  Loo Hay Lee,et al.  Differentiated service inventory optimization using nested partitions and MOCBA , 2009, Comput. Oper. Res..

[7]  Enver Yücesan,et al.  A new perspective on feasibility determination , 2008, 2008 Winter Simulation Conference.

[8]  Loo Hay Lee,et al.  Simulation optimization using the cross-entropy method with optimal computing budget allocation , 2010, TOMC.

[9]  James Kennedy,et al.  Defining a Standard for Particle Swarm Optimization , 2007, 2007 IEEE Swarm Intelligence Symposium.

[10]  Chukwudi Anyakoha,et al.  A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications , 2008, Natural Computing.

[11]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[12]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[13]  Loo Hay Lee,et al.  Efficient Simulation Budget Allocation for Selecting an Optimal Subset , 2008, INFORMS J. Comput..

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

[15]  Gül Gürkan,et al.  Sample-path optimization in simulation , 1994, Proceedings of Winter Simulation Conference.

[16]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[17]  BanksAlec,et al.  A review of particle swarm optimization. Part II , 2007 .

[18]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[19]  J. Kennedy,et al.  Stereotyping: improving particle swarm performance with cluster analysis , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).