Abstract

In order to solve the complicated multimodal problems, this paper presents a variant of particle swarm optimizer (PSO) based on the simulation of the human social communication behavior (HSCPSO). In HSCPSO, each particle initially joins a default number of social circles (SC) that consist of some particles, and its learning exemplars include three parts, namely, its own best experience, the experience of the best performing particle in all SCs, and the experiences of the particles of all SCs it is a member of. The learning strategy takes full advantage of the excellent information of each particle to improve the diversity of the swarm to discourage premature convergence. To weight the effects of the particles on the SCs, the worst performing particles will join more SCs to learn from other particles and the best performing particles will leave SCs to reduce their strong influence on other members. Additionally, to insure the effectiveness of solving multimodal problems, the novel parallel hybrid mutation is proposed to improve the particle’s ability to escape from the local optima. Experiments were conducted on a set of classical benchmark functions, and the results demonstrate the good performance of HSCPSO in escaping from the local optima and solving the complex multimodal problems compared with the other PSO variants.

Highlights

  • Particle swarm optimization PSO, originally introduced by Kennedy and Eberhart 1, has proven to be a powerful competitor to other evolutionary algorithms e.g., genetic algorithms 2

  • We present an improved PSO based on human social communication

  • To determine whether the result obtained by HSCPSO is statistically different from the results of the other six PSO variants, the Wilcoxon rank sum tests are conducted between the HSCPSO result and the best result achieved by the other five PSO variants on each test problem, and the test results are presented in the last row of Tables 4 and 5

Read more

Summary

Introduction

Particle swarm optimization PSO , originally introduced by Kennedy and Eberhart 1 , has proven to be a powerful competitor to other evolutionary algorithms e.g., genetic algorithms 2. When solving the unconstraint optimization problem, PSO has empirically turned out to perform well on many optimization problems When it comes to solving complex multimodal problems, PSO may get trapped in a local optimum. We present an improved PSO based on human social communication. This strategy ensures the swarm’s diversity against the premature convergence, especially when solving the complex multimodal problems.

Particle Swarm Optimization
Related Works
Updating Strategy of Particle Velocity
Parallel Hybrid Mutation
HSCPSO’s Parameter Settings and Analysis of the Swarm’s Diversity
Minimum and Maximum of Allowed SC Number
Search Bounds Limitation
Analysis of Swarm’s Diversity
Test Functions and Parameter Settings of PSO Variants
Fixed Iteration Results and Analysis
Result
Robustness Analysis
Conclusions and Future Works
Full Text
Paper version not known

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