• DocumentCode
    1875906
  • Title

    An efficient population diversity measure for improved particle swarm optimization algorithm

  • Author

    Chi, Yuhong ; Sun, Fuchun ; Jiang, Langfan ; Yu, Chunming

  • Author_Institution
    Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China
  • fYear
    2012
  • fDate
    6-8 Sept. 2012
  • Firstpage
    361
  • Lastpage
    367
  • Abstract
    By the comparison study on several commonly used population diversity measures, we find that the conclusions derived from these diversity measures are not in keeping with the knowledge accepted by many scholars, and the relationship between population diversity and the evolutionary process of PSO is questionable. To deal with the above mentioned problems, a novel population diversity measure based on the optimal point is proposed in this paper, where the outliers are discarded, and the measure results are easy to understand the evolutionary state of the PSO algorithm. Furthermore, the optimal point-based diversity (O-diversity) measure is studied to control the population diversity and improve the optimization performance of PSO algorithm. The study results verify that the O-diversity measure is effective and useful to assess and control the population diversity, and it is meaningful to guide to better optimization performance of the advanced PSO algorithm.
  • Keywords
    evolutionary computation; particle swarm optimisation; PSO; evolutionary process; optimal point-based diversity measure; optimization performance; particle swarm optimization algorithm; population diversity control; population diversity measure; Atmospheric measurements; Convergence; Optimization; Particle measurements; Position measurement; Sociology; Statistics; measure; optimization performance; outlier; particle swarm optimization; population diversity;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Systems (IS), 2012 6th IEEE International Conference
  • Conference_Location
    Sofia
  • Print_ISBN
    978-1-4673-2276-8
  • Type

    conf

  • DOI
    10.1109/IS.2012.6335243
  • Filename
    6335243