A Chaos Particle Swarm Optimization Based on Adaptive Inertia Weight

Article Preview

Abstract:

In this paper, the chaotic optimization algorithm is embedded in traditional PSO algorithm using randomness and ergodicity of the chaotic characteristic, and random numbers and a inertia weight factor in PSO algorithm is substituted respectively by chaotic variables and an adaptive inertia weight function, so the ACEPSO algorithm is proposed in order to overcome the drawbacks of CPSO algorithm that easily falls into local optimum. With the simulation experiments, the effectiveness of ACEPSO algorithm is verified by optimization tests with the complex multi-dimensional function. The simulation results verify that the ACEPSO algorithm is robust, high precision, and strong global convergence, and is a kind of practical and feasible optimization algorithm.

You might also be interested in these eBooks

Info:

Periodical:

Key Engineering Materials (Volumes 474-476)

Pages:

1458-1463

Citation:

Online since:

April 2011

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Lovbjerg M, Rasmussen T K, Krink T., Hybrid particle swarm optimization with breeding ad subpopulations, Genetic ad Evolutionary Computation Conf, San Francisco: Morgan Kaufann Publishers, 2001, 469-476.

Google Scholar

[2] 8 Liu, L Wang, Y-H Jin, F Tang, D X Huang, Improved particle swarm optimization combined with chaos, Chaos Solitons &Fractals, (S0960-0779), 2005, 25(21): 1261-1271.

DOI: 10.1016/j.chaos.2004.11.095

Google Scholar

[3] Shi Y, Eberhart RC, Parameter selection in particle swarm optimization, Proceedings of the 7th interational conference on evolutionary programming VII, LNCS, vol. 1447, New York, Springer-Verlag, 2004, pp.591-600.

DOI: 10.1007/bfb0040810

Google Scholar

[4] Coelho LdS, Mariai V C, A novel chaotic particle swarm optimization approach using He'non map and implicit fltering local search for economic load dispach, Chaos , Solitons & Fractals , 2007, 27(2), 279-307.

DOI: 10.1016/j.chaos.2007.01.093

Google Scholar

[5] LIAG Huiyong, GU Xinsheng, A novel chaos optimization algorithm based on parallel computing, ] of East China University of Science and Technology, 2004, 30(4): 450-453.

Google Scholar

[6] LI Wen, LIAG Ximing, A hybrid algorithm based on chaos optimization ad steepest descent algorithm", Computing Technology and Automation, 2003, 22(2): 12-14.M. Young, The Technical Writer, s Handbook. Mill Valley, CA: University Science, (1989).

Google Scholar