The Bedbug Meta-heuristic Algorithm to Solve Optimization Problems

被引:8
|
作者
Rezvani, Kouroush [1 ]
Gaffari, Ali [2 ]
Dishabi, Mohammad Reza Ebrahimi [1 ]
机构
[1] Islamic Azad Univ, Dept Comp Engn, Miyaneh Branch, Miyaneh, Iran
[2] Islamic Azad Univ, Dept Comp Engn, Tabriz Branch, Tabriz, Iran
关键词
Bedbug Meta-Heuristic Algorithm; Optimization algorithm; BMHA; BUG;
D O I
10.1007/s42235-023-00356-8
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Small parasitic Hemipteran insects known as bedbugs (Cimicidae) feed on warm-blooded mammal's blood. The most famous member of this family is the Cimex lectularius or common bedbug. The current paper proposes a novel swarm intelligence optimization algorithm called the Bedbug Meta-Heuristic Algorithm (BMHA). The primary inspiration for the bedbug algorithm comes from the static and dynamic swarming behaviors of bedbugs in nature. The two main stages of optimization algorithms, exploration, and exploitation, are designed by modeling bedbug social interaction to search for food. The proposed algorithm is benchmarked qualitatively and quantitatively using many test functions including CEC2019. The results of evaluating BMHA prove that this algorithm can improve the initial random population for a given optimization problem to converge towards global optimization and provide highly competitive results compared to other well-known optimization algorithms. The results also prove the new algorithm's performance in solving real optimization problems in unknown search spaces. To achieve this, the proposed algorithm has been used to select the features of fake news in a semi-supervised manner, the results of which show the good performance of the proposed algorithm in solving problems.
引用
收藏
页码:2465 / 2485
页数:21
相关论文
共 50 条
  • [1] The Bedbug Meta-heuristic Algorithm to Solve Optimization Problems
    Kouroush Rezvani
    Ali Gaffari
    Mohammad Reza Ebrahimi Dishabi
    [J]. Journal of Bionic Engineering, 2023, 20 : 2465 - 2485
  • [2] A novel hybrid meta-heuristic algorithm for optimization problems
    Gai, Wendong
    Qu, Chengzhi
    Liu, Jie
    Zhang, Jing
    [J]. SYSTEMS SCIENCE & CONTROL ENGINEERING, 2018, 6 (03): : 64 - 73
  • [3] Immune Plasma Algorithm: A Novel Meta-Heuristic for Optimization Problems
    Aslan, Selcuk
    Demirci, Sercan
    [J]. IEEE ACCESS, 2020, 8 : 220227 - 220245
  • [4] ORCA OPTIMIZATION ALGORITHM: A NEW META-HEURISTIC TOOL FOR COMPLEX OPTIMIZATION PROBLEMS
    Golilarz, Noorbakhsh Amiri
    Gao, Hui
    Addeh, Abdoljalil
    Pirasteh, Saeid
    [J]. 2020 17TH INTERNATIONAL COMPUTER CONFERENCE ON WAVELET ACTIVE MEDIA TECHNOLOGY AND INFORMATION PROCESSING (ICCWAMTIP), 2020, : 198 - 204
  • [5] Lion pride optimization algorithm: A meta-heuristic method for global optimization problems
    Kaveh, A.
    Mahjoubi, S.
    [J]. SCIENTIA IRANICA, 2018, 25 (06) : 3113 - 3132
  • [6] Meta-heuristic algorithm to solve two-sided assembly line balancing problems
    Wirawan, A. D.
    Maruf, A.
    [J]. 2ND INTERNATIONAL MANUFACTURING ENGINEERING CONFERENCE AND 3RD ASIA-PACIFIC CONFERENCE ON MANUFACTURING SYSTEMS (IMEC-APCOMS 2015), 2016, 114
  • [7] Design and applications of an advanced hybrid meta-heuristic algorithm for optimization problems
    Parouha, Raghav Prasad
    Verma, Pooja
    [J]. ARTIFICIAL INTELLIGENCE REVIEW, 2021, 54 (08) : 5931 - 6010
  • [8] Criminal Search Optimization Algorithm: A Population-Based Meta-Heuristic Optimization Technique to Solve Real-World Optimization Problems
    Abhishek Srivastava
    Dushmanta Kumar Das
    [J]. Arabian Journal for Science and Engineering, 2022, 47 : 3551 - 3571
  • [9] Criminal Search Optimization Algorithm: A Population-Based Meta-Heuristic Optimization Technique to Solve Real-World Optimization Problems
    Srivastava, Abhishek
    Das, Dushmanta Kumar
    [J]. ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2022, 47 (03) : 3551 - 3571
  • [10] Design and applications of an advanced hybrid meta-heuristic algorithm for optimization problems
    Raghav Prasad Parouha
    Pooja Verma
    [J]. Artificial Intelligence Review, 2021, 54 : 5931 - 6010