Provided by: International Journal of Electronics and Computer Science Engineering
Date Added: Sep 2012
Particle Swarm Optimization (PSO) algorithms have been proposed to solve many engineering problems that require finding an optimal point of operation. PSO is not only susceptible to premature convergence, but also shows a highly problem dependant performance. Due to its apparently lower problem-dependency and more resistant to premature convergence, Regrouping Particle Swarm Optimization (RegPSO) algorithm is highly applicable for solving problems about which little is known in advance and it approximate the true global minima with a better probability.