.png){kind=icon}
.png){kind=icon}
Return
Particle swarm algorithm with hybrid mutation strategy
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2011.05.046.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A new particle swarm optimization (PSO) that incorporates a hybrid mutation strategy is proposed. In this paper we first use the Monte Carlo method to investigate the behavior of the particle in PSO. The results reveal the essence of the particle's trajectory during executions and the reasons why PSO has relative poor global searching ability especially in the last stage of evolution. Then we present a new hybrid particle swarm optimization which incorporates Henon map mutation operation (HPSO) so as to enhance the achievement of PSO. The new mutation strategy divides the mutation operator into global and local mutation operators, then it enables the particles to have stronger exploration ability and fast convergence rate. Sixteen benchmark functions are used to test the performance of HPSO. The results show that the new PSO algorithm performs better than the other hybrid PSO algorithms for each of the test functions. Meanwhile, HPSO is applied to a practical problem (i.e., the economic dispatch problem in a power system) with a satisfying result. (C) 2011 Elsevier B. V. All rights reserved.
Keywords:
Particle swarm optimization
Monte Carlo Simulation
Henon map
Mutation
Power system
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W