Bee-foraging learning particle swarm optimization

doi:10.1016/j.asoc.2021.107134

Return

Bee-foraging learning particle swarm optimization

2021-04-01

陈

陈旭 (Xu Chen) *

Wenli Du

DOI：10.1016/j.asoc.2021.107134

Original

Save

View PDF

Abstract

En 中文

Numerous particle swarm optimization (PSO) algorithms have been developed for solving numerical optimization problems in recent years. However, most of existing PSO algorithms have only one search phase. There is no strengthened search phase for the well-performed particles, and also no re-initialization phase for the exhausted particles. These issues may still restrict the performance of PSO for complex optimization problems. In this paper, inspired by the bee-foraging search mechanism of artificial bee colony algorithm, a novel bee-foraging learning PSO (BFL-PSO) algorithm is proposed. Different from existing PSO algorithms, the proposed BFL-PSO has three different search phases, namely employed learning, onlooker learning and scout learning. The employed learning phase works like traditional one-phase-based PSO, while the onlooker learning phase performs strengthened search around those well-performed particles to exploit promising solutions, and the scout learning phase re-initializes those exhausted particles to introduce new diversity. The proposed BFL-PSO is comprehensively evaluated on CEC2014 benchmark functions, and compared with state-of-the-art PSO algorithms as well as artificial bee colony algorithms. The experimental results show that BFL-PSO achieves very competitive performance in terms of solution accuracy. In addition, the effectiveness of the newly introduced onlooker learning and scout learning phases in BFL-PSO is verified. (C) 2021 Elsevier B.V. All rights reserved.

Keywords:

Particle swarm optimization

Bee-foraging learning mechanism

Artificial bee colony

Numerical optimization

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.