An improved particle swarm optimiser based on swarm success rate for global optimisation problems

被引:19
|
作者
Adewumi, Aderemi Oluyinka [1 ]
Arasomwan, Akugbe Martins [1 ]
机构
[1] Univ Kwazulu Natal South Africa, Sch Math Stat & Comp Sci, Private Bag X54001, ZA-4000 Durban, South Africa
关键词
particle swarm optimisation; inertia weights; global optimisation; success rate; chaos; ALGORITHMS;
D O I
10.1080/0952813X.2014.971444
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Inertia weight is one of the control parameters that influences the performance of particle swarm optimisation (PSO) in the course of solving global optimisation problems, by striking a balance between exploration and exploitation. Among many inertia weight strategies that have been proposed in literature are chaotic descending inertia weight (CDIW) and chaotic random inertia weight (CRIW). These two strategies have been claimed to perform better than linear descending inertia weight (LDIW) and random inertia weight (RIW). Despite these successes, a closer look at their results reveals that the common problem of premature convergence associated with PSO algorithm still lingers. Motivated by the better performances of CDIW and CRIW, this paper proposed two new inertia weight strategies namely: swarm success rate descending inertia weight (SSRDIW) and swarm success rate random inertia weight (SSRRIW). These two strategies use swarm success rates as a feedback parameter. Efforts were made using the proposed inertia weight strategies with PSO to further improve the effectiveness of the algorithm in terms of convergence speed, global search ability and improved solution accuracy. The proposed PSO variants, SSRDIWPSO and SSRRIWPSO were validated using several benchmark unconstrained global optimisation test problems and their performances compared with LDIW-PSO, CDIW-PSO, RIW-PSO, CRIW-PSO and some other existing PSO variants. Empirical results showed that the proposed variants are more efficient.
引用
收藏
页码:441 / 483
页数:43
相关论文
共 50 条
  • [1] A new particle swarm optimiser for linearly constrained optimisation
    Paquet, U
    Engelbrecht, AP
    [J]. CEC: 2003 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-4, PROCEEDINGS, 2003, : 227 - 233
  • [2] An improved particle swarm optimisation based on cellular automata
    Dai, Yuntao
    Liu, Liqiang
    Li, Ying
    Song, Jingyi
    [J]. INTERNATIONAL JOURNAL OF COMPUTING SCIENCE AND MATHEMATICS, 2014, 5 (01) : 94 - 106
  • [3] Cooperative Charged Particle Swarm Optimiser
    Rakitianskaia, Anna
    Engelbrecht, Andries P.
    [J]. 2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 933 - 939
  • [4] Particle swarm optimisation for dynamic optimisation problems: a review
    Jordehi, Ahmad Rezaee
    [J]. NEURAL COMPUTING & APPLICATIONS, 2014, 25 (7-8): : 1507 - 1516
  • [5] Particle swarm optimisation for discrete optimisation problems: a review
    Ahmad Rezaee Jordehi
    Jasronita Jasni
    [J]. Artificial Intelligence Review, 2015, 43 : 243 - 258
  • [6] Particle swarm optimisation for dynamic optimisation problems: a review
    Ahmad Rezaee Jordehi
    [J]. Neural Computing and Applications, 2014, 25 : 1507 - 1516
  • [7] Particle swarm optimisation for discrete optimisation problems: a review
    Jordehi, Ahmad Rezaee
    Jasni, Jasronita
    [J]. ARTIFICIAL INTELLIGENCE REVIEW, 2015, 43 (02) : 243 - 258
  • [8] A Convergence Proof for the Particle Swarm Optimiser
    van den Bergh, Frans
    Engelbrecht, Andries Petrus
    [J]. FUNDAMENTA INFORMATICAE, 2010, 105 (04) : 341 - 374
  • [9] A polar coordinate particle swarm optimiser
    Matthysen, Wiehann
    Engelbrecht, Andries P.
    [J]. APPLIED SOFT COMPUTING, 2011, 11 (01) : 1322 - 1339
  • [10] Cultural-based particle swarm for dynamic optimisation problems
    Daneshyari, Moayed
    Yen, Gary G.
    [J]. INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2012, 43 (07) : 1284 - 1304