151. Hovering Swarm Particle Swarm Optimization
- Author
-
Aasam Abdul Karim, Nor Ashidi Mat Isa, and Wei Hong Lim
- Subjects
Particle swarm optimization ,multiswarm learning framework ,nearest neighbors ,global optimization ,exemplar-based learning ,Electrical engineering. Electronics. Nuclear engineering ,TK1-9971 - Abstract
PSO is a simple and yet powerful metaheuristic search algorithm widely used to solve various optimization problems. Nevertheless, conventional PSO tends to lose its population diversity drastically and suffer with compromised performance when encountering the optimization problems with complex fitness landscapes. Extensive studies suggest the needs of preserving high population diversity for PSO to escape from the local optima in order to solve complex optimization problems effectively. Inspired by these ideas, a hovering swarm PSO (HSPSO) is proposed in this paper, where a computationally efficient diversity preservation scheme is first introduced to divide the population of HSPSO into a main swarm and a hovering swarm. An exemplar construction scheme is subsequently proposed in the main swarm of HSPSO to generate a universal exemplar by considering the promising directional information contributed by the other non-fittest particles. The proposed universal exemplar is envisioned to suppress the negative impacts of global best particle, while remain effective to guide all particles of main swarm converging towards the promising solution regions. While hovering around the main swarm, an intelligent scheme is introduced to dynamically adjust inertia weights of all hovering swarm members to achieve proper balancing of exploration and exploitation searches at swarm levels. Extensive performance analyses are conducted by using the proposed HSPSO to solve 30 benchmark functions of CEC 2014 and five real-world engineering applications. Simulation results reveal that the HSPSO is able outperform the state-of-art optimizers when solving most tested functions due to its excellent diversity preservation capability.
- Published
- 2021
- Full Text
- View/download PDF