J4 ›› 2012, Vol. 47 ›› Issue (3): 27-32.

• Articles • Previous Articles     Next Articles

Chaos particle swarm optimization based on the adaptive inertia weight

ZHOU Yan1,2, LIU Pei-yu 1,2, ZHAO Jing1,2, WANG Qian-long1,2   

  1. 1. School of Information Science and Engineering, Shandong Normal University, Jinan 250014, Shandong, China;
    2. Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology,
    Jinan 250014, Shandong, China
  • Received:2011-11-30 Online:2012-03-20 Published:2012-04-01

Abstract:

Aiming at the premature convergence problem which the particle swarm optimization algorithm suffers from, a chaos particle swarm optimization based on adaptive inertia weight is proposed. Firstly, chaotic sequence generated by cube map is used to initiate individual position, which strengthens the diversity of global searching. Secondly, adaptive inertia weight is adopted to improve the convergence rate. Furthermore, chaos perturbation is utilized to avoid the premature convergence. The results of the simulation experiment show that the convergence rate and the precision of the improved algorithm are obviously enhanced, and the algorithm can effectively avoid the premature convergence problem.

Key words:  particle swarm optimization; cube map; adaptive inertia weight; chaos perturbation

No related articles found!
Viewed
Full text
1652
HTML PDF
Just accepted Online first Issue Just accepted Online first Issue
0 0 0 0 0 1652

  From Others local
  Times 302 1350
  Rate 18% 82%

Abstract
1207
Just accepted Online first Issue
0 0 1207
  From Others local
  Times 1181 26
  Rate 98% 2%

Cited

Web of Science  Crossref   ScienceDirect  Search for Citations in Google Scholar >>
 
This page requires you have already subscribed to WoS.
  Shared   
  Discussed   
No Suggested Reading articles found!