• DocumentCode
    3487696
  • Title

    Bare bones particle swarms

  • Author

    Kennedy, James

  • Author_Institution
    US Bur. of Labor Stat., Washington, DC, USA
  • fYear
    2003
  • fDate
    24-26 April 2003
  • Firstpage
    80
  • Lastpage
    87
  • Abstract
    The particle swarm algorithm has just enough moving parts to make it hard to understand. The formula is very simple, it is even easy to describe the working of the algorithm verbally, yet it is very difficult to grasp in one´s mind how the particles oscillate around centers that are constantly changing; how they influence one another; how the various parameters affect the trajectory of the particle; how the topology of the swarm affects its performance; and so on. This paper strips away some traditional features of the particle swarm in the search for the properties that make it work. The particle swarm algorithm is modified by eliminating the velocity formula. Variations are compared. In the process some of the mysteries of the algorithm are revealed, we discover its similarity to other stochastic population-based problem solving methods, and new avenues of investigation are suggested or implied.
  • Keywords
    evolutionary computation; problem solving; search problems; stochastic programming; topology; bare bones particle swarms; particle oscillation; particle trajectory; population-based problem solving; stochastic problem solving; swarm topology; velocity formula; Bones; Lattices; Particle swarm optimization; Performance evaluation; Problem-solving; Statistics; Stochastic processes; Strips; Testing; Topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Swarm Intelligence Symposium, 2003. SIS '03. Proceedings of the 2003 IEEE
  • Print_ISBN
    0-7803-7914-4
  • Type

    conf

  • DOI
    10.1109/SIS.2003.1202251
  • Filename
    1202251