A Hybrid Social Spider Optimization Algorithm with Differential Evolution for Global Optimization

被引:0
作者
Qiu, Jianfeng [1 ,2 ,3 ]
Xie, Juan [4 ]
Cheng, Fan [1 ,2 ,3 ]
Zhang, Xuefeng [3 ]
Zhang, Lei [1 ,2 ,3 ]
机构
[1] Anhui Univ, Key Lab Intelligent Comp & Signal Proc, Minist Educ, Hefei 230039, Anhui, Peoples R China
[2] Anhui Univ, Inst Bioinspired Intelligence & Min Knowledge, Hefei 230039, Anhui, Peoples R China
[3] Anhui Univ, Sch Comp Sci & Technol, Hefei 230039, Anhui, Peoples R China
[4] Anhui Jianzhu Univ, Sch Math & Phys, Hefei 230601, Anhui, Peoples R China
关键词
social-spider algorithm; swarm intelligence algorithm; global optimization; weighting factor; BEE COLONY ALGORITHM;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Social Spider Optimization (SSO) algorithm is a swarm intelligence optimization algorithm based on the mating behavior of social spiders. Numerical simulation results have shown that SSO outperformed some classical swarm intelligence algorithms such as Particle Swarm Optimization (PSO) algorithm and Artificial Bee Colony (ABC) algorithm and so on. However, there are still some deficiencies about SSO algorithm, such as the poor balance between exploration and exploitation. To this end, an improved SSO algorithm named wDESSO is proposed for global optimization, which can balance exploration and exploitation effectively. Specifically, a weighting factor changing with iteration is introduced to control and adjust the search scope of SSO algorithm dynamically. After social-spiders have completed their search, a mutation operator is then suggested for jumping out of the potential local optimization, thus can further strengthen the ability of global search. The experimental results on a set of standard benchmark functions demonstrate the effectiveness of wDESSO in solving complex numerical optimization problems.
引用
收藏
页码:619 / 635
页数:17
相关论文
共 40 条
  • [1] [Anonymous], 2010, IEEE C EV COMP
  • [2] [Anonymous], 1999, Swarm Intelligence
  • [3] [Anonymous], 1992, Ph.D. thesis
  • [4] Evolution strategies – A comprehensive introduction
    Hans-Georg Beyer
    Hans-Paul Schwefel
    [J]. Natural Computing, 2002, 1 (1) : 3 - 52
  • [5] Aviles L., 1997, CAUSES CONSEQUENCES
  • [6] The best-so-far selection in Artificial Bee Colony algorithm
    Banharnsakun, Anan
    Achalakul, Tiranee
    Sirinaovakul, Booncharoen
    [J]. APPLIED SOFT COMPUTING, 2011, 11 (02) : 2888 - 2901
  • [7] Biswas A, 2007, NEURAL NETW WORLD, V17, P607
  • [8] Self-adapting control parameters in differential evolution: A comparative study on numerical benchmark problems
    Brest, Janez
    Greiner, Saso
    Boskovic, Borko
    Mernik, Marjan
    Zumer, Vijern
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (06) : 646 - 657
  • [9] Cheng R., 2016, IEEE T EVOLUTIONARY
  • [10] A Multiobjective Evolutionary Algorithm Using Gaussian Process-Based Inverse Modeling
    Cheng, Ran
    Jin, Yaochu
    Narukawa, Kaname
    Sendhoff, Bernhard
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (06) : 838 - 856