Brain Storm Optimization Algorithm Based on Improved Clustering Approach Using Orthogonal Experimental Design

摘要

The brain storm optimization (BSO) algorithm is a new and promising swarm intellgience paradigm, inspired from the behaviors of the human process of brainstorming. The noverty of BSO lies in the clustering mechanism where the ideas are clustered into a set of groups and each idea learns from experiences of one inter-cluster or two intra-cluster neighbors. However, this mechanism is inefficient to deal with complex optimiaiton problems. In this paper, we propose an improved BSO algorithm called OSBSO using orthogonal experimental design (OED) strategy, which aims to discover useful search experiences for improving the convergence and solution accurancy. In OSBSO, two new clustering procedures are developed, i.e., orthogonal initialization and orthogonal clustering. The orthogonal initialization aims to improve the uniformity of the initial cluster centers in the objective space instead of the decision space, which can enhance the convergence performance. The orthogonal clustering uses the information between inter- cluster and intra-cluster indviduals to alleviate the evolution stagnation of clusters. Experiments are conducted on a set of the CEC2017 benchmark functions and the results verify the effectivenss and efficiency of OSBSO.