A Modified Spider Monkey Optimization Algorithm Based on GoodPoint Set and Enhancing Position Update

被引:0
|
作者
Raheem S.F. [1 ]
Alabbas M. [2 ]
机构
[1] Basra Technical Institute, Southern Technical University, Basrah
[2] Department of Computer Science, College of Computer Science and Information Technology, University of Basrah, Basrah
来源
Informatica (Slovenia) | 2023年 / 47卷 / 04期
关键词
enhancing position update; good-point-set method; spider monkey optimization; swarm intelligence;
D O I
10.31449/INF.V47I4.4531
中图分类号
学科分类号
摘要
Spider monkey optimization (SMO), developed based on the behavior of spider monkeys, is a recently added swarm intelligence algorithm. SMO is a stochastic population-based metaheuristic algorithm. Spider monkeys have a fission-fusion social structure. In addition to being an excellent tool for solving optimization problems, SMO provides good exploration and exploitation capabilities. In this work, we present a modified strategy for improving the performance of the basic SMO in two ways: (a) we use the good-point-set method instead of random initial population generation; and (b) by changing both the local leader and global leader phases, we modify the SMO position update approach to increase global convergence while avoiding local optima. We evaluate the proposed modified SMO algorithm on 20 popular benchmark functions. The current findings prove that the proposed approach outperforms the standard SMO regarding result quality and convergence rate. © 2023 Slovene Society Informatika. All rights reserved.
引用
收藏
页码:569 / 576
页数:7
相关论文
共 50 条
  • [1] Fitness Based Position Update in Spider Monkey Optimization Algorithm
    Kumar, Sandeep
    Kumari, Rajani
    Sharma, Vivek Kumar
    PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON SOFT COMPUTING AND SOFTWARE ENGINEERING (SCSE'15), 2015, 62 : 442 - 449
  • [2] Modified Spider Monkey Optimization
    Hazrati, Garima
    Sharma, Harish
    Sharma, Nirmala
    Bansal, Jagdish Chand
    2016 INTERNATIONAL WORKSHOP ON COMPUTATIONAL INTELLIGENCE (IWCI), 2016, : 209 - 214
  • [3] Spider Monkey Optimization Algorithm Based on Metropolis Principle
    Hazrati, Garima
    Sharma, Harish
    Sharma, Nirmala
    Agarwal, Vani
    Tiwari, D. C.
    PROCEEDINGS OF SIXTH INTERNATIONAL CONFERENCE ON SOFT COMPUTING FOR PROBLEM SOLVING (SOCPROS 2016), VOL 1, 2017, 546 : 113 - 121
  • [4] Spider Monkey Optimization algorithm for numerical optimization
    Jagdish Chand Bansal
    Harish Sharma
    Shimpi Singh Jadon
    Maurice Clerc
    Memetic Computing, 2014, 6 : 31 - 47
  • [5] Spider Monkey Optimization algorithm for numerical optimization
    Bansal, Jagdish Chand
    Sharma, Harish
    Jadon, Shimpi Singh
    Clerc, Maurice
    MEMETIC COMPUTING, 2014, 6 (01) : 31 - 47
  • [6] Hyperbolic spider monkey optimization algorithm
    Kumar S.
    Nayyar A.
    Nguyen N.G.
    Kumari R.
    Kumari, Rajani (rajanikpoonia@gmail.com), 1600, Bentham Science Publishers (13): : 35 - 42
  • [7] Ageist Spider Monkey Optimization algorithm
    Sharma, Avinash
    Sharma, Akshay
    Panigrahi, B. K.
    Kiran, Deep
    Kumar, Rajesh
    SWARM AND EVOLUTIONARY COMPUTATION, 2016, 28 : 58 - 77
  • [8] Disruption Operator-based Spider Monkey Optimization Algorithm
    Kaur, Avinash
    Sharma, Harish
    Sharma, Nirmala
    2017 IEEE INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION AND AUTOMATION (ICCCA), 2017, : 216 - 221
  • [9] Spider monkey optimization algorithm for constrained optimization problems
    Gupta, Kavita
    Deep, Kusum
    Bansal, Jagdish Chand
    SOFT COMPUTING, 2017, 21 (23) : 6933 - 6962
  • [10] Spider monkey optimization algorithm for constrained optimization problems
    Kavita Gupta
    Kusum Deep
    Jagdish Chand Bansal
    Soft Computing, 2017, 21 : 6933 - 6962