A Complex Neighborhood Based Particle Swarm Optimization   [PS] [PSO]

by

Godoy, A. and Zuben, F., J., V.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: 2009 IEEE Congress on Evolutionary Computation (Conference proceedings), 2009, p. -
Abstract:
This paper proposes a new variant of the PSO algorithm named Complex Neighborhood Particle Swarm [PS] Optimizer (CNPSO) for solving global optimization problems. [GO] [OP] In the CNPSO, the neighborhood of the particles is organized through a complex network which is modified during the search process. [SP] 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, [PC] 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.
Notes:
CEC 2009 - A joint meeting of the IEEE, the EPS and the IET.}, IEEE Catalog Number: CFP09ICE-CDR
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry



BibTex:
@inproceedings(Godoy:2009:cec,
  author = "Alan Godoy and Fernando J. {Von Zuben}",
  title = "A Complex Neighborhood Based Particle Swarm Optimization",
  booktitle = "2009 IEEE Congress on Evolutionary Computation",
  year = 2009,
  editor = "Andy Tyrrell",
  pages = {--},
  address = "Trondheim, Norway",
  month = "18-21 May",
  organization ="IEEE Computational Intelligence Society",
  publisher = "IEEE Press",
  note = {},
  ISBN = "978-1-4244-2959-2",
  file = {P580.pdf},
  url = {},
  size = {},
  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.  },
  notes =	{CEC 2009 - A joint meeting of the IEEE, the EPS and the IET.},
IEEE Catalog Number: CFP09ICE-CDR},
)