Ranking-based biased learning swarm optimizer for large-scale optimization

Large-scale optimization, solving real high-dimensional problems, has attracted many research interests. Large-scale optimization problems are far more difficult than traditional optimization problems due to their numerous local optimum. In this paper, a principle of maximizing the fitness difference between learners and exemplars is proposed to improve the performance of the optimization algorithm. Then based on the principle, a improved particle swarm optimization algorithm called the ranking-based biased learning swarm optimizer for large-scale optimization (RBLSO) is proposed. The proposed RBLSO contains two types of learning strategies, namely, ranking paired learning (RPL) and biased center learning (BCL). In RPL, the worse particles learn peer to peer from the better particles according to their ranks, so then the convergence speed will be accelerated. In BCL, each particle learns from the biased center that is defined as the fitness weighted center of the whole swarm. This operator is utilized to strengthen the explorative ability of the algorithm. To test the performances of the proposed algorithm, we conduct some experiments on the proposed learning mechanism. RBLSO is compared with several state-of-the-art large-scale optimization algorithms on two widely used benchmark function sets, CEC2010 and CEC2013. These two function sets were proposed for the special session and competition on large-scale global optimization held under the Congress on Evolutionary Computation (CEC) 2010 and 2013. Experimental results show that RBLSO is effective in solving large-scale optimization problems. (C) 2019 Elsevier Inc. All rights reserved.