Title :
A Complex Neighborhood based Particle Swarm Optimization
Author :
Godoy, Alan ; Von Zuben, Fernando J.
Author_Institution :
Lab. of Bioinf. & Bioinspired Comput. (LBiC), Univ. of Campinas (Unicamp), Campinas
Abstract :
This paper proposes a new variant of the PSO algorithm named complex neighborhood particle swarm optimizer (CNPSO) for solving global optimization problems. In the CNPSO, the neighborhood of the particles is organized through a complex network which is modified during the search process. This evolution of the topology seeks to improve the influence of the most successful particles and it is fine tuned for maintaining the scale-free characteristics of the network while the optimization is being performed. The use of a scale-free topology instead of the usual regular or global neighborhoods is intended to bring to the search procedure a better capability of exploring promising regions without a premature convergence, which would result in the procedure being easily trapped in a local optimum. The performance of the CNPSO is compared with the standard PSO on some well-known and high-dimensional benchmark functions, ranging from multimodal to plateau-like problems. In all the cases the CNPSO outperformed the standard PSO.
Keywords :
complex networks; particle swarm optimisation; search problems; CNPSO; complex neighborhood particle swarm optimizer; complex network; scale-free characteristics; search process; topology evolution; Bioinformatics; Biological system modeling; Collaborative tools; Complex networks; Computer networks; Convergence; Evolution (biology); Humans; Network topology; Particle swarm optimization;
Conference_Titel :
Evolutionary Computation, 2009. CEC '09. IEEE Congress on
Conference_Location :
Trondheim
Print_ISBN :
978-1-4244-2958-5
Electronic_ISBN :
978-1-4244-2959-2
DOI :
10.1109/CEC.2009.4983016