Bacterial Particle Swarm Optimization Algorithm

Article Preview

Abstract:

The loss of the population diversity leads to the premature convergence in existing particle swarm optimization(PSO) algorithm. In order to solve this problem, a novel version of PSO algorithm called bacterial PSO(BacPSO), was proposed in this paper. In the new algorithm, the individuals were replaced by bacterial, and a new evolutionary mechanism was designed by the basic law of evolution of bacterial colony. Such evolutionary mechanism also generated a new natural termination criterion. Propagation and death operators were used to keep the population diversity of BacPSO. The simulation results show that BacPSO algorithm not only significantly improves convergence speed ,but also can converge to the global optimum.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 211-212)

Pages:

968-972

Citation:

Online since:

February 2011

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] J. Kennedy,R. Eberhart. Particle swarm optimization. Pro. IEEE International Conf: on Neural Networks. Perth. Australia. 1995: 1943-(1948).

Google Scholar

[2] Liu Junmin, Gao Yuelin: Computer Applications Vol. 28(2008), p.322–325, in Chinese.

Google Scholar

[3] Feng Yuanjing, Yu Li, Feng Zu-ren: Control Theory & Applications Vol. 26(2009), p.28–34, in chinese.

Google Scholar

[4] V.D.B. Frans, P.E. Andries. A cooperative approach to particle swarm optimization[J]. IEEE Trans. on Evolutionary Computation. 2004. 8(3): 225-239.

Google Scholar

[5] Li Ming, Yang Cheng and Yang Chengwu: Published by Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane P.O. Box 1331, Piscataway, NJ08855-1331, United States(2008), pp.8738-8742.

Google Scholar

[6] M. Clerc,J. Kennedy. The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. on Evolutionary Computation. 2002. 6(1): 58-73.

DOI: 10.1109/4235.985692

Google Scholar