Abstract

Particle swarm optimisation (PSO) is an efficient optimisation technique, which has shown good search performance on many optimisation problems. However, the standard PSO easily falls into local minima because particles are attracted by their previous best particles and the global best particle. Though the attraction can accelerate the search process, it results in premature convergence. To tackle this issue, a novel PSO algorithm with hybrid strategies is proposed in this paper. The new approach called HPSO employs two strategies: a new velocity updating model and generalised opposition-based learning (GOBL). To test the performance of HPSO, 12 benchmark functions including multimodal and rotated problems are used in the experiments. Computational results show that our approach achieves promising performance.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call