Skip to Main Content
An adaptive particle swarm optimization (PSO) was proposed based on a version of PSO without the velocity of the previous iteration. To overcome premature searching for the velocity of a particle at zero, reinitialize the velocity of the particle with a random velocity. Simultaneity, to enhance exploration in the early stage and exploitation during the latter, we introduce exponential time-varying acceleration coefficients. The simulation results show that the algorithm has better probability of finding global optimum and mean best value than others algorithm.
Information Processing, 2009. APCIP 2009. Asia-Pacific Conference on (Volume:2 )
Date of Conference: 18-19 July 2009