##
**An improved particle swarm optimization algorithm combined with piecewise linear chaotic map.**
*(English)*
Zbl 1122.65363

Summary: Particle swarm optimization (PSO) has gained increasing attention in tackling complex optimization problems. Its further superiority when hybridized with other search techniques is also shown. Chaos, with the properties of ergodicity and stochasticity, is definitely a good candidate, but currently only the well-known logistic map is prevalently used. In this paper, the performance and deficiencies of schemes coupling chaotic search into PSO are analyzed. Then, the piecewise linear chaotic map (PWLCM) is introduced to perform the chaotic search. An improved PSO algorithm combined with PWLCM is proposed subsequently, and experimental results verify its great superiority.

### Keywords:

Particle swarm optimization; chaotic optimization; piecewise linear chaotic map; numerical examples
PDF
BibTeX
XML
Cite

\textit{T. Xiang} et al., Appl. Math. Comput. 190, No. 2, 1637--1645 (2007; Zbl 1122.65363)

Full Text:
DOI

### References:

[1] | J. Kennedy, R.C. Eberhart, Particle swarm optimization, in: Proceedings of IEEE International Conference on Neural Networks, Perth, Australia, 1995, pp. 1942-1948. |

[2] | R.C. Eberhart, J. Kennedy, A new optimizer using particle swarm theory, in: Proceedings of the Sixth International Symposium on Micro Machine and Human Science (MHS’95), Nagoya, Japan, 1995, pp. 39-43. |

[3] | Y. Shi, R. Eberhart, A modified particle swarm optimizer, in: Proceedings of IEEE International Conference on Evolutionary Computation, Anchorage, USA, 1998, pp. 69-73. |

[4] | Clerc, M.; Kennedy, J., The particle swarmexplosion, stability, and convergence in a multidimensional complex space, IEEE transactions on evolutionary computation, 6, 1, 58-73, (2002) |

[5] | Mendes, R.; Kennedy, J.; Neves, J., The fully informed particle swarm: simpler, maybe better, IEEE transactions on evolutionary computation, 8, 3, 204-210, (2004) |

[6] | Janson, S.; Middendorf, M., A hierarchical particle swarm optimizer and its adaptive variant, IEEE transactions on systems, man, and cybernetics – part B: cybernetics, 35, 6, 1272-1282, (2005) |

[7] | Shi, X.H.; Lianga, Y.C.; Lee, H.P.; Lu, C.; Wang, L.M., An improved ga and a novel pso-ga-based hybrid algorithm, Information processing letters, 93, 255-261, (2005) · Zbl 1173.68828 |

[8] | Z. Cui, J. Zeng, X. Cai, A new stochastic particle swarm optimizer, in: Proceedings of IEEE Congress on Evolutionary Computation (CEC’04), Portland, USA, 2004, pp. 316-319. |

[9] | X. Wang, J. Li, Hybrid particle swarm optimization with simulated annealing, in: Proceedings of the International Conference on Machine Learning and Cybernetics, Shanghai, China, 2004, pp. 2402-2405. |

[10] | Li, B.; Jiang, W., Optimizing complex functions by chaos search, Cybernetics and systems, 29, 4, 409-419, (1998) · Zbl 1012.90068 |

[11] | H. Meng, P. Zheng, R. Wu, X. Hao, Z. Xie, A hybrid particle swarm algorithm with embedded chaotic search, in: Proceedings of IEEE Conference on Cybernetics and Intelligent Systems, Singapore, 2004, pp. 367-371. |

[12] | Liu, B.; Wang, L.; Jin, Y.; Tang, F.; Huang, D., Improved particle swarm optimization combined with chaos, Chaos, solitons and fractals, 25, 1261-1271, (2005) · Zbl 1074.90564 |

[13] | Jiang, C.; Bompardb, E., A hybrid method of chaotic particle swarm optimization and linear interior for reactive power optimisation, Mathematics and computers in simulation, 68, 57-65, (2005) · Zbl 1108.90048 |

[14] | Jiang, C.; Bompard, E., A self-adaptive chaotic particle swarm algorithm for short term hydroelectric system scheduling in deregulated environment, Energy conversion and management, 46, 2689-2696, (2005) |

[15] | Baranovsky, A.; Daems, D., Design of one-dimensional chaotic maps with prescribed statistical properties, International journal of bifurcation and chaos, 5, 6, 1585-1598, (1995) · Zbl 0886.58054 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.