TY - JOUR
T1 - An Improved Brain Storm Optimization with Differential Evolution Strategy for Applications of ANNs
AU - Cao, Zijian
AU - Hei, Xinhong
AU - Wang, Lei
AU - Shi, Yuhui
AU - Rong, Xiaofeng
N1 - Publisher Copyright:
© 2015 Zijian Cao et al.
PY - 2015
Y1 - 2015
N2 - Brain Storm Optimization (BSO) algorithm is a swarm intelligence algorithm inspired by human being's behavior of brainstorming. The performance of BSO is maintained by the creating process of ideas, but when it cannot find a better solution for some successive iterations, the result will be so inefficient that the population might be trapped into local optima. In this paper, we propose an improved BSO algorithm with differential evolution strategy and new step size method. Firstly, differential evolution strategy is incorporated into the creating operator of ideas to allow BSO jump out of stagnation, owing to its strong searching ability. Secondly, we introduce a new step size control method that can better balance exploration and exploitation at different searching generations. Finally, the proposed algorithm is first tested on 14 benchmark functions of CEC 2005 and then is applied to train artificial neural networks. Comparative experimental results illustrate that the proposed algorithm performs significantly better than the original BSO.
AB - Brain Storm Optimization (BSO) algorithm is a swarm intelligence algorithm inspired by human being's behavior of brainstorming. The performance of BSO is maintained by the creating process of ideas, but when it cannot find a better solution for some successive iterations, the result will be so inefficient that the population might be trapped into local optima. In this paper, we propose an improved BSO algorithm with differential evolution strategy and new step size method. Firstly, differential evolution strategy is incorporated into the creating operator of ideas to allow BSO jump out of stagnation, owing to its strong searching ability. Secondly, we introduce a new step size control method that can better balance exploration and exploitation at different searching generations. Finally, the proposed algorithm is first tested on 14 benchmark functions of CEC 2005 and then is applied to train artificial neural networks. Comparative experimental results illustrate that the proposed algorithm performs significantly better than the original BSO.
UR - http://www.scopus.com/inward/record.url?scp=84942808362&partnerID=8YFLogxK
U2 - 10.1155/2015/923698
DO - 10.1155/2015/923698
M3 - Article
AN - SCOPUS:84942808362
SN - 1024-123X
VL - 2015
JO - Mathematical Problems in Engineering
JF - Mathematical Problems in Engineering
M1 - 923698
ER -