Sine-Cosine-Barnacles Algorithm Optimizer with disruption operator for global optimization and automatic data clustering

被引:11
|
作者
Abd Elaziz, Mohamed [1 ,2 ,3 ]
Ewees, Ahmed A. [4 ,5 ]
Al-qaness, Mohammed A. A. [6 ]
Abualigah, Laith [7 ,8 ,9 ]
Ibrahim, Rehab Ali [3 ]
机构
[1] Galala Univ, Fac Comp Sci & Engn, Suze 435611, Egypt
[2] Ajman Univ, Artificial Intelligence Res Ctr AIRC, Ajman, U Arab Emirates
[3] Zagazig Univ, Fac Sci, Dept Math, Zagazig, Egypt
[4] Univ Bisha, Fac Comp & Informat Technol, Dept Informat Syst, Bisha, Saudi Arabia
[5] Damietta Univ, Dept Comp, Kafr Saad, Egypt
[6] Wuhan Univ, State Key Lab Informat Engn Surveying, Mapping & Remote Sensing, Wuhan 430079, Peoples R China
[7] Amman Arab Univ, Fac Comp Sci & Informat, Amman 11953, Jordan
[8] Univ Sains Malaysia, Sch Comp Sci, George Town 11800, Malaysia
[9] Middle East Univ, Fac Informat Technol, Amman 11831, Jordan
基金
中国国家自然科学基金;
关键词
Optimization techniques; Swarm-intelligence; Sine– Cosine Algorithm; Barnacles mating optimizer; Exploration and exploitation; PARTICLE SWARM OPTIMIZATION; SEARCH ALGORITHM; HYBRID; EVOLUTION; DIAGNOSIS; SYSTEMS; LSHADE; MODEL;
D O I
10.1016/j.eswa.2022.117993
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, an improved Barnacles Mating Optimizer (BMO) is proposed to deal with optimization problems and develop a new automatic clustering approach. BMO is a well-established optimization technique inspired by the mating behavior of barnacles in real-life. The exploratory trends of BMO are influential and can maintain the right balance among exploration and exploitation. However, this population-based method can be improved further to reduce the probability of potential drawbacks for any optimization technique. As such, we revised the core searching phased of BMO based on a sine-cosine algorithm (SCA) and disruption operators (DO). The proposed method is named BMSCD, which updates the current solution by switching between the mechanisms of the BMO and SCA based on a probability calculated using the fitness value of the current solution. The experiments results on various benchmark cases for global optimizations demonstrate the improved performance of the proposed BMSCD in terms of quality of solutions, the balance of the exploration- exploitation, and convergence rates. Besides, the proposed BMSCD is evaluated by nine measures in solving different clustering problems. The results show that the BMSCD can effectively and powerfully address the tested problems and provide excellent performance compared to the state-of-the-art methods.
引用
收藏
页数:26
相关论文
共 50 条
  • [21] Hybrid Generalized Normal Distribution Optimization with Sine Cosine Algorithm for Global Optimization
    Too, Jingwei
    Sadiq, Ali Safaa
    Akbari, Hesam
    Mong, Guo Ren
    Mirjalili, Seyedali
    PROCEEDINGS OF 7TH INTERNATIONAL CONFERENCE ON HARMONY SEARCH, SOFT COMPUTING AND APPLICATIONS (ICHSA 2022), 2022, 140 : 35 - 42
  • [22] An Enhanced Brain Storm Sine Cosine Algorithm for Global Optimization Problems
    Li, Chunquan
    Luo, Zu
    Song, Zhenshou
    Yang, Feng
    Fan, Jinghui
    Liu, Peter X.
    IEEE ACCESS, 2019, 7 : 28211 - 28229
  • [23] A Modified Sine Cosine Algorithm With Teacher Supervision Learning for Global Optimization
    Xian, Hang
    Yang, Chenglin
    Wang, Houjun
    Yang, Xiaoyan
    IEEE ACCESS, 2021, 9 : 17744 - 17766
  • [24] An improved Opposition-Based Sine Cosine Algorithm for global optimization
    Abd Elaziz, Mohamed
    Oliva, Diego
    Xiong, Shengwu
    EXPERT SYSTEMS WITH APPLICATIONS, 2017, 90 : 484 - 500
  • [25] Bare-Bones Based Sine Cosine Algorithm for global optimization
    Li, Ning
    Wang, Lei
    JOURNAL OF COMPUTATIONAL SCIENCE, 2020, 47
  • [26] A sine cosine algorithm guided by elite pool strategy for global optimization
    Deng, Lingyun
    Liu, Sanyang
    APPLIED SOFT COMPUTING, 2024, 164
  • [27] Dimension by dimension dynamic sine cosine algorithm for global optimization problems
    Li, Yu
    Zhao, Yiran
    Liu, Jingsen
    APPLIED SOFT COMPUTING, 2021, 98
  • [28] A probabilistic simplified sine cosine crow search algorithm for global optimization problems
    Rao, Yundi
    He, Dengxu
    Qu, Liangdong
    ENGINEERING WITH COMPUTERS, 2023, 39 (03) : 1823 - 1841
  • [29] An improved sine–cosine algorithm based on orthogonal parallel information for global optimization
    Rizk M. Rizk-Allah
    Soft Computing, 2019, 23 : 7135 - 7161
  • [30] Pairwise Global Sequence Alignment Using Sine-Cosine Optimization Algorithm
    Issa, Mohamed
    Hassanien, Aboul Ella
    Helmi, Ahmed
    Ziedan, Ibrahim
    Alzohairy, Ahmed
    INTERNATIONAL CONFERENCE ON ADVANCED MACHINE LEARNING TECHNOLOGIES AND APPLICATIONS (AMLTA2018), 2018, 723 : 102 - 111