A Novel Particle Swarm Optimal Algorithm Hybridized with Random Disturbance Term

Article Preview

Abstract:

Recently, Particle Swarm Optimization (PSO) has received increasing interest from the optimization community due to its simplicity in implementation and its high speed computational capability. However, traditional PSO has premature convergence problem. To prevent the premature convergence of PSO, some modified algorithms is proposed, based on these modified algorithms a novel hybrid algorithm with random disturbance is proposed in this paper. The performance of the proposed algorithm is testified on a suite of benchmark functions. The simulation results show that this hybridized PSO has great capability of preventing premature convergence and faster computing speed.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 765-767)

Pages:

473-476

Citation:

Online since:

September 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] James Kennedy, Russell Eberhart. Particle Swarm Optimization. Proc IEEE, International Conference on Neural Networks, Perth, Australia: IEEE Computational Intelligence Society, 1995: 1942-(1948).

Google Scholar

[2] Eberhart R, Kennedy J. A new optimizer using particle swarm theory. Proc 6th Int Symposium on Micro Machine and Human Science, Nagoya, 1995: 39- 43.

DOI: 10.1109/mhs.1995.494215

Google Scholar

[3] Shi Y, Eberhart R. Empirical. Study of particle swarm optimization. Proc of Congress on Computational Intelligence, Washington DC, USA, 1999: 1945- (1950).

Google Scholar

[4] Angeline P. Using selection to improve particle swarm optimization. Proc of IJCNNp99, Washinton, USA, 1999: 84- 89.

Google Scholar

[5] Clere M. The swarm and the queen: towards a deterministic and adaptive particle swarm optimization. Proc of the Congress of Evolutionary Computation, Piscataway, NJ, 1999: 1951- (1957).

DOI: 10.1109/cec.1999.785513

Google Scholar

[6] Shi Y, Eberhart R. Fuzzy adaptive particle swarm optimization. Proc of the Congress on Evolutionary Computation, Seoul, Korea, 2001: 101- 106.

DOI: 10.1109/cec.2001.934377

Google Scholar

[7] Natsuki H. Particle swarm optimization with Gaussian mutation. Proc of the Congress on Evolutionary Computation, Indianapolis, Indiana, 2003: 72- 79.

Google Scholar

[8] Shi Y, Eberhart R. A modified particle swarm optimizer . IEEE World Congress on Computational Intelligence. Piscataway: IEEE Press, 1998: 69-73.

DOI: 10.1109/icec.1998.699146

Google Scholar

[9] Zhang L P, Yu H J, Hu S X. A new approach to improve particle swarm optimization. Lecture Notes in Computer Science. Chicago: Springer Verlag, 2003: 134-139.

Google Scholar

[10] Chen G M , Huang X B , Jia J Y, et al. Natural exponential inertia weight strategy in particle swarm optimization . Proc of 6th Congress on Intelligent Control and Automation. Dalian: IEEE Press, 2006 : 3672-3675.

DOI: 10.1109/wcica.2006.1713055

Google Scholar