Please use this identifier to cite or link to this item:
|Type:||Artigo de evento|
|Title:||A Complex Neighborhood Based Particle Swarm Optimization|
Von Zuben F.J.
|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 wellknown and high-dimensional benchmark functions, ranging from multimodal to plateau-like problems. In all the cases theCNPSO outperformed the standard PSO. © 2009 IEEE.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.