• DocumentCode
    3001196
  • Title

    A hierarchical particle swarm optimizer

  • Author

    Janson, Stefan ; Middendorf, Martin

  • Author_Institution
    Dept. of Comput. Sci., Leipzig Univ., Germany
  • Volume
    2
  • fYear
    2003
  • fDate
    8-12 Dec. 2003
  • Firstpage
    770
  • Abstract
    A hierarchical version of the particle swarm optimization method called H-PSO is introduced. In H-PSO the particles are arranged in a dynamic hierarchy that is used to define a neighborhood structure. Depending on the quality of their so far best found solution the particles move up or down the hierarchy so that good particles have a higher influence on the swarm. Moreover, the hierarchy is used to define different search properties for the particles. Several variants of H-PSO are compared experimentally with variants of the standard PSO.
  • Keywords
    optimisation; tree searching; dynamic hierarchy; hierarchical particle swarm optimization; neighborhood structure; tree searching; Computer science; Iterative algorithms; Iterative methods; Multidimensional systems; Optimization methods; Parallel processing; Particle swarm optimization; Tree data structures; Velocity control;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation, 2003. CEC '03. The 2003 Congress on
  • Print_ISBN
    0-7803-7804-0
  • Type

    conf

  • DOI
    10.1109/CEC.2003.1299745
  • Filename
    1299745