• DocumentCode
    3393165
  • Title

    An improved cooperative PSO algorithm

  • Author

    Shen Huisheng ; Zhao Yanmin

  • Author_Institution
    Coll. of Math. & Comput. Sci., Fuzhou Univ., Fuzhou, China
  • fYear
    2011
  • fDate
    19-22 Aug. 2011
  • Firstpage
    1040
  • Lastpage
    1042
  • Abstract
    The original PSO algorithms are disturbed by the "curse of dimensionality", which concludes that their performance deteriorates as the dimensionality of the search space increase. This paper shows a variation on the original PSO algorithm, called improved cooperative particle swarm algorithm, or COPSO, employing cooperative behavior to significantly improve the performance of the original algorithm, and then we add a constriction factor to the CPSO to form an improved CPSO algorithm (ICPSO). Finally, the paper do the experiments on three classic functions, the result of the ICPSO algorithm, relatives to the classic PSO algorithm and the COPSO algorithm, shows the better optimization performance.
  • Keywords
    particle swarm optimisation; classic functions; constriction factor; cooperative behavior; curse of dimensionality; improved cooperative particle swarm optimization algorithm; search space; Approximation algorithms; Collaboration; Convergence; Educational institutions; Optimization; Particle swarm optimization; Partitioning algorithms; Particle Swarm Optimization; cooperative evolution; improved Cooperative Particle Swarm Optimization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Mechatronic Science, Electric Engineering and Computer (MEC), 2011 International Conference on
  • Conference_Location
    Jilin
  • Print_ISBN
    978-1-61284-719-1
  • Type

    conf

  • DOI
    10.1109/MEC.2011.6025643
  • Filename
    6025643