Modified-improved fitness dependent optimizer for complex and engineering problems

被引:5
作者
Hamarashid, Hozan K. [1 ]
Hassan, Bryar A. [2 ,3 ]
Rashid, Tarik A. [2 ]
机构
[1] Sulaimani Polytech Univ, Comp Sci Inst, Informat Technol Dept, Sulaimani, Iraq
[2] Univ Kurdistan Hewler, Comp Sci & Engn Dept, Erbil, Iraq
[3] Charmo Univ, Coll Sci, Dept Comp Sci, Chamchamal Sulaimani 46023, Iraq
关键词
Modified improved fitness dependent optimizer; M-IFDO; Metaheuristic algorithms and optimization; ALGORITHM;
D O I
10.1016/j.knosys.2024.112098
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Fitness dependent optimizer (FDO) is considered one of the novel swarm intelligent algorithms. Recently, FDO has been enhanced several times to improve its capability. One of the improvements is called improved FDO (IFDO). However, according to the research findings, the variants of FDO are constrained by two primary limitations that have been identified. Firstly, if the number of agents employed falls below five, it significantly diminishes the algorithm 's precision. Secondly, the efficacy of FDO is intricately tied to the quantity of search agents utilized. To overcome these limitations, this study proposes a modified version of IFDO, called M-IFDO. The enhancement is conducted by updating the location of the scout bee to the IFDO to move the scout bees to achieve better performance and optimal solutions. More specifically, two parameters in IFDO, which are alignment and cohesion, are removed. Instead, the Lambda parameter is replaced in the place of alignment and cohesion. To verify the performance of the newly introduced algorithm, M-IFDO is tested on 19 basic benchmark functions, 10 IEEE Congress of Evolutionary Computation (CEC - C06 2019), and five real-world problems. MIFDO is compared against five state-of-the-art algorithms: Improved Fitness Dependent Optimizer (IFDO), Improving Multi-Objective Differential Evolution algorithm (IMODE), Hybrid Sampling Evolution Strategy (HSES), Linear Success-History based Parameter Adaptation for Differential Evolution (LSHADE) and CMA-ES Integrated with an Occasional Restart Strategy and Increasing Population Size and An Iterative Local Search (NBIPOP-aCMAES). The verification criteria are based on how well the algorithm reaches convergence, memory usage, and statistical results. The results show that M-IFDO surpasses its competitors in several cases on the benchmark functions and five real-world problems.
引用
收藏
页数:15
相关论文
共 74 条
[1]  
Hassan BA, 2021, Arxiv, DOI arXiv:2105.08131
[2]  
Muhammed DA, 2019, Arxiv, DOI arXiv:1911.01165
[3]   Using Fitness Dependent Optimizer for Training Multi-layer Perceptron [J].
Abbas, Dosti Kh ;
Rashid, Tarik A. ;
Abdalla, Karmand H. ;
Bacanin, Nebojsa ;
Alsadoon, Abeer .
JOURNAL OF INTERNET TECHNOLOGY, 2021, 22 (07) :1575-1586
[4]   An Adaptive Fitness-Dependent Optimizer for the One-Dimensional Bin Packing Problem [J].
Abdul-Minaam, Diaa Salama ;
Al-Mutairi, Wadha Mohammed Edkheel Saqar ;
Awad, Mohamed A. ;
El-Ashmawi, Walaa H. .
IEEE ACCESS, 2020, 8 :97959-97974
[5]  
Abdulkhaleq Maryam T, 2023, Comput Methods Programs Biomed Update, V3, P100090, DOI 10.1016/j.cmpbup.2022.100090
[6]   Multi-objective fitness-dependent optimizer algorithm [J].
Abdullah, Jaza M. ;
Rashid, Tarik A. ;
Maaroof, Bestan B. ;
Mirjalili, Seyedali .
NEURAL COMPUTING & APPLICATIONS, 2023, 35 (16) :11969-11987
[7]   Fitness Dependent Optimizer: Inspired by the Bee Swarming Reproductive Process [J].
Abdullah, Jaza Mahmood ;
Rashid, Tarik Ahmed .
IEEE ACCESS, 2019, 7 :43473-43486
[8]   Salp swarm algorithm: a comprehensive survey [J].
Abualigah, Laith ;
Shehab, Mohammad ;
Alshinwan, Mohammad ;
Alabool, Hamzeh .
NEURAL COMPUTING & APPLICATIONS, 2020, 32 (15) :11195-11215
[9]   Human behavior-based optimization: a novel metaheuristic approach to solve complex optimization problems [J].
Ahmadi, Seyed-Alireza .
NEURAL COMPUTING & APPLICATIONS, 2017, 28 :S233-S244
[10]   A better exploration strategy in Grey Wolf Optimizer [J].
Bansal, Jagdish Chand ;
Singh, Shitu .
JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2021, 12 (01) :1099-1118