Improved Hybrid Firefly Algorithm with Probability Attraction Model

被引:2
|
作者
Bei, Jin-Ling [1 ]
Zhang, Ming-Xin [2 ]
Wang, Ji-Quan [1 ]
Song, Hao-Hao [1 ]
Zhang, Hong-Yu [1 ]
机构
[1] Northeast Agr Univ, Coll Engn, Harbin 150030, Peoples R China
[2] Shijiazhuang Posts & Telecommun Tech Coll, Comp Dept, Shijiazhuang 050020, Peoples R China
关键词
improved hybrid firefly algorithm; probability attraction model; constrained optimization problem; remove similarity operation; combined mutation; DIFFERENTIAL EVOLUTION; SWARM ALGORITHM; NEURAL-NETWORK; OPTIMIZATION; OPPOSITION; SYSTEM;
D O I
10.3390/math11020389
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
An improved hybrid firefly algorithm with probability attraction model (IHFAPA) is proposed to solve the problems of low computational efficiency and low computational accuracy in solving complex optimization problems. First, the method of square-root sequence was used to generate the initial population, so that the initial population had better population diversity. Second, an adaptive probabilistic attraction model is proposed to attract fireflies according to the brightness level of fireflies, which can minimize the brightness comparison times of the algorithm and moderate the attraction times of the algorithm. Thirdly, a new location update method is proposed, which not only overcomes the deficiency in that the relative attraction of two fireflies is close to 0 when the distance is long but also overcomes the deficiency that the relative attraction of two fireflies is close to infinity when the distance is small. In addition, a combinatorial variational operator based on selection probability is proposed to improve the exploration and exploitation ability of the firefly algorithm (FA). Later, a similarity removal operation is added to maintain the diversity of the population. Finally, experiments using CEC 2017 constrained optimization problems and four practical problems in engineering show that IHFAPA can effectively improve the quality of solutions.
引用
收藏
页数:59
相关论文
共 50 条
  • [1] An Improved Firefly Algorithm Based on An Attraction Switch
    Liu, Jianxun
    Shi, Jinfei
    Hao, Fei
    [J]. 2021 INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND INTELLIGENT CONTROLS (ISCSIC 2021), 2021, : 355 - 360
  • [2] An improved firefly algorithm based on probabilistic attraction
    Yu, Gan
    [J]. INTERNATIONAL JOURNAL OF COMPUTING SCIENCE AND MATHEMATICS, 2016, 7 (06) : 530 - 536
  • [3] A hybrid firefly algorithm based on modified neighbourhood attraction
    Chen, Rongfang
    Tang, Jun
    [J]. International Journal of Innovative Computing and Applications, 2022, 13 (5-6) : 290 - 295
  • [4] Hybrid firefly algorithm with grouping attraction for constrained optimization problem
    Cheng, Zhiwen
    Song, Haohao
    Wang, Jiquan
    Zhang, Hongyu
    Chang, Tiezhu
    Zhang, Mingxin
    [J]. KNOWLEDGE-BASED SYSTEMS, 2021, 220
  • [5] Firefly algorithm with random attraction
    Wang, Hui
    Wang, Wenjun
    Sun, Hui
    Rahnamayan, Shahryar
    [J]. INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2016, 8 (01) : 33 - 41
  • [6] Firefly algorithm with neighborhood attraction
    Wang, Hui
    Wang, Wenjun
    Zhou, Xinyu
    Sun, Hui
    Zhao, Jia
    Yu, Xiang
    Cui, Zhihua
    [J]. INFORMATION SCIENCES, 2017, 382 : 374 - 387
  • [7] An Improved Firefly Algorithm With Specific Probability and Its Engineering Application
    Wang, Chunfeng
    Chu, Xinyue
    [J]. IEEE ACCESS, 2019, 7 : 57424 - 57439
  • [8] An Improved Hybrid Firefly Algorithm for Solving Optimization Problems
    Wahid, Fazli
    Ghazali, Rozaida
    Shah, Habib
    [J]. RECENT ADVANCES ON SOFT COMPUTING AND DATA MINING (SCDM 2018), 2018, 700 : 14 - 23
  • [9] An improved hybrid firefly algorithm for capacitated vehicle routing problem
    Altabeeb, Asma M.
    Mohsen, Abdulqader M.
    Ghallab, Abdullatif
    [J]. APPLIED SOFT COMPUTING, 2019, 84
  • [10] A Hybrid Firefly Algorithm
    Qi, Xiangbo
    Zhu, Sihan
    Zhang, Hao
    [J]. 2017 IEEE 2ND ADVANCED INFORMATION TECHNOLOGY, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (IAEAC), 2017, : 287 - 291