Particle Swarm Optimizers with Growing Tree Topology

• MIYAGAWA Eiji

  Hosei University

• SAITO Toshimichi

  Hosei University

Abstract

This paper presents a new particle swarm optimizer characterized by growing tree topology. If a particle is stagnated then a new particle is born and is located away from the trap. Depending on the property of objective problems, particles are born successively and the growing swarm constitutes a tree-topology. Performing numerical experiments for typical benchmarks, the algorithm efficiency is evaluated in several key measures such as success rate, the number of iterations and the number of particles. As compared with other basic PSOs, we can suggest that the proposed algorithm has efficient performance in optimization with low-cost computation.

Journal

• IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E92-A (9), 2275-2282, 2009

  The Institute of Electronics, Information and Communication Engineers

Keywords

• optimization
• swarm intelligence
• particle swarm optimization
• network topology
• growing graph

Details

• CRID: 1390282681287761280
• NII Article ID: 10026859652
• NII Book ID: AA10826239
• DOI: 10.1587/transfun.e92.a.2275
• BIBCODE: 2009IEITF..92.2275M
• ISSN: 17451337
• ISSN: 09168508
• Web Site: http://www.jstage.jst.go.jp/article/transfun/E92.A/9/E92.A_9_2275/_pdf
• Text Lang: en
• Data Source:
  • JaLC
  • Crossref
  • CiNii Articles
• Abstract License Flag: Disallowed