Improved social spider algorithm for large scale optimization

被引:15
|
作者
Bas, Emine [1 ]
Ulker, Erkan [2 ]
机构
[1] Selcuk Univ, Kulu Vocat Sch, TR-42075 Konya, Turkey
[2] Konya Tech Univ, Fac Engn & Nat Sci, Dept Comp Engn, TR-42075 Konya, Turkey
关键词
Heuristic methods; Optimization; Social spider algorithm; Large-scale dimension; PARTICLE SWARM OPTIMIZATION; ANT COLONY OPTIMIZATION; GLOBAL OPTIMIZATION; FIREFLY ALGORITHM; INTELLIGENCE; SELECTION; EVOLUTION;
D O I
10.1007/s10462-020-09931-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Heuristic algorithms can give optimal solutions for low, middle, and large scale optimization problems in an acceptable time. The social spider algorithm (SSA) is one of the recent meta-heuristic algorithms that imitate the behaviors of the spider to perform global optimization. The original study of this algorithm was proposed to solve low scale continuous problems, and it is not be solved to middle and large scale continuous problems. In this paper, we have improved the SSA and have solved middle and large scale continuous problems, too. By adding two new techniques to the original SSA, the performance of the original SSA has been improved and it is named as an improved SSA (ISSA). In this paper, various unimodal and multimodal standard benchmark functions for low, middle, and large-scale optimization are studied for displaying the performance of ISSA. ISSA's performance is also compared with the well-known and new evolutionary methods in the literature. Test results show that ISSA displays good performance and can be used as an alternative method for large scale optimization.
引用
收藏
页码:3539 / 3574
页数:36
相关论文
共 50 条
  • [41] Toward text psychology analysis using social spider optimization algorithm
    Hosseinalipour, Ali
    Gharehchopogh, Farhad Soleimanian
    Masdari, Mohammad
    Khademi, Ali
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2021, 33 (17):
  • [42] Optimum design of steel space structures using social spider optimization algorithm with spider jump technique
    Aydogdu, Ibrahim
    Efe, Perihan
    Yetkin, Metin
    Akin, Alper
    STRUCTURAL ENGINEERING AND MECHANICS, 2017, 62 (03) : 259 - 272
  • [43] An improved weighted optimization approach for large-scale global optimization
    Chen, Minyang
    Du, Wei
    Song, Wenjiang
    Liang, Chen
    Tang, Yang
    COMPLEX & INTELLIGENT SYSTEMS, 2022, 8 (02) : 1259 - 1280
  • [44] An improved weighted optimization approach for large-scale global optimization
    Minyang Chen
    Wei Du
    Wenjiang Song
    Chen Liang
    Yang Tang
    Complex & Intelligent Systems, 2022, 8 : 1259 - 1280
  • [45] An Improved Social Spider Algorithm for the Flexible Job-Shop Scheduling Problem
    Wang, Yao
    Zhu, Linbo
    Wang, Jiwen
    Qiu, Jianfeng
    PROCEEDINGS OF 2015 INTERNATIONAL CONFERENCE ON ESTIMATION, DETECTION AND INFORMATION FUSION ICEDIF 2015, 2015, : 157 - 162
  • [46] Spider Monkey Optimization algorithm for numerical optimization
    Jagdish Chand Bansal
    Harish Sharma
    Shimpi Singh Jadon
    Maurice Clerc
    Memetic Computing, 2014, 6 : 31 - 47
  • [47] Spider Monkey Optimization algorithm for numerical optimization
    Bansal, Jagdish Chand
    Sharma, Harish
    Jadon, Shimpi Singh
    Clerc, Maurice
    MEMETIC COMPUTING, 2014, 6 (01) : 31 - 47
  • [48] Demand Side Optimization in Smart Grid Using Harmony Search Algorithm and Social Spider Algorithm
    Junaid, Muhammad
    Rahim, Muhammad Hassan
    Rehman, Anwar Ur
    Ali, Waqar
    Awais, Muhammad
    Bilal, Tamour
    Javaid, Nadeem
    ADVANCES ON P2P, PARALLEL, GRID, CLOUD AND INTERNET COMPUTING (3PGCIC-2017), 2018, 13 : 16 - 25
  • [49] Improved genetic algorithm for pipe diameter optimization of an existing large-scale district heating network
    Xu, Han
    Zhang, Lu
    Wang, Xuanbo
    Han, Baocheng
    Luo, Zhengyuan
    Bai, Bofeng
    ENERGY, 2024, 304
  • [50] An ensemble bat algorithm for large-scale optimization
    Cai, Xingjuan
    Zhang, Jiangjiang
    Liang, Hao
    Wang, Lei
    Wu, Qidi
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2019, 10 (11) : 3099 - 3113