PSO Algorithm Based on Accumulation Effect and Mutation
Abstract
Particle SwarmOptimization (PSO) algorithm is a new swarm intelligence optimization technique, because of its simplicity, fewerparameters and good effects, PSO has been widely used to solve various complexoptimization problems. particle swarm optimization(PSO) exist the problems ofpremature and local convergence, we proposed an improved particle swarm optimization based on aggregation effect and with mutation operator, whichdetermines whether the aggregation occurs in searching, if there is then theGaussian mutation is detected to theglobal extremum, to overcome particle swarm optimization falling into localoptimal solution defects. Testing thenew algorithm by a typical test function, the results show that, compared withthe conventional genetic algorithm (SGA), it improves the ability of globaloptimization, but also effectively avoid the premature convergence.
Keywords
Full Text:
PDFRefbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).