Modified Brain Storm Optimization Algorithm for Multimodal Optimization

Multimodal optimization is one of the most challenging tasks for optimization. The difference between multimodal optimization and single objective optimization problem is that the former needs to find both multiple global and local optima at the same time. A novel swarm intelligent method, Self-adaptive Brain Storm Optimization (SBSO) algorithm, is proposed to solve multimodal optimization problems in this paper. In order to obtain potential multiple global and local optima, a max-fitness grouping cluster method is used to divide the ideas into different sub-groups. And different sub-groups can help to find the different optima during the search process. Moreover, the self-adaptive parameter control is applied to adjust the exploration and exploitation of the proposed algorithm. Several multimodal benchmark functions are used to evaluate the effectiveness and efficiency. Compared with the other competing algorithms reported in the literature, the new algorithm can provide better solutions and show good performance.

[1]  Xiaodong Li,et al.  Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology , 2010, IEEE Transactions on Evolutionary Computation.

[2]  Xiaodong Li,et al.  This article has been accepted for inclusion in a future issue. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 Locating and Tracking Multiple Dynamic Optima by a Particle Swarm Model Using Speciation , 2022 .

[3]  Shengxiang Yang,et al.  A memetic particle swarm optimization algorithm for multimodal optimization problems , 2011, 2011 Chinese Control and Decision Conference (CCDC).

[4]  Yuhui Shi,et al.  Brain Storm Optimization Algorithm , 2011, ICSI.

[5]  Jing J. Liang,et al.  Differential Evolution With Neighborhood Mutation for Multimodal Optimization , 2012, IEEE Transactions on Evolutionary Computation.

[6]  Jiang-She Zhang,et al.  A dynamic clustering based differential evolution algorithm for global optimization , 2007, Eur. J. Oper. Res..

[7]  Hui Wang,et al.  Gaussian Bare-Bones Differential Evolution , 2013, IEEE Transactions on Cybernetics.

[8]  Frank W. Moore,et al.  Automatic selection of sub-populations and minimal spanning distances for improved numerical optimization , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[9]  Zhi-hui Zhan,et al.  A modified brain storm optimization , 2012, 2012 IEEE Congress on Evolutionary Computation.

[10]  Xiaodong Li,et al.  Efficient differential evolution using speciation for multimodal function optimization , 2005, GECCO '05.

[11]  Swagatam Das,et al.  Multimodal optimization by artificial weed colonies enhanced with localized group search optimizers , 2013, Appl. Soft Comput..

[12]  Zachary V. Hendershot.  A Differential Evolution Algorithm for Automatically Discovering Multiple Global Optima in Multidimensional, Discontinuous Spaces , 2004, MAICS.

[13]  René Thomsen,et al.  Multimodal optimization using crowding-based differential evolution , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[14]  Arthur C. Sanderson,et al.  JADE: Adaptive Differential Evolution With Optional External Archive , 2009, IEEE Transactions on Evolutionary Computation.

[15]  Ponnuthurai N. Suganthan,et al.  A Distance-Based Locally Informed Particle Swarm Model for Multimodal Optimization , 2013, IEEE Transactions on Evolutionary Computation.