Bat algorithm with triangle-flipping strategy for numerical optimization

被引:0
|
作者
Xingjuan Cai
Hui Wang
Zhihua Cui
Jianghui Cai
Yu Xue
Lei Wang
机构
[1] Taiyuan University of Science and Technology,School of Computer Science and Technology
[2] Nanchang Institute of Technology,Jiangxi Province Key Laboratory of Water Information Cooperative Sensing and Intelligent Processing
[3] Nanjing University of Information Science and Technology,School of Computer and Software
[4] Tongji University,Department of Control Science and Engineering
关键词
Bat algorithm; Random triangle-flipping strategy; Directing triangle-flipping strategy; Hybrid triangle-flipping strategy;
D O I
暂无
中图分类号
学科分类号
摘要
Bat algorithm (BA) is a novel population-based evolutionary algorithm inspired by echolocation behavior. Due to its simple concept, BA has been widely applied to various engineering applications. As an optimization approach, the global search characteristics determine the optimization performance and convergence speed. In BA, the global search capability is dominated by the velocity updating. How to update the velocity of bats may seriously affect the performance of BA. In this paper, we propose a triangle-flipping strategy to update the velocity of bats. Three different triangle-flipping strategies with five different designs are introduced. The optimization performance is verified by CEC2013 benchmarks in those designs against the standard BA. Simulation results show that the hybrid triangle-flipping strategy is superior to other algorithms.
引用
收藏
页码:199 / 215
页数:16
相关论文
共 50 条
  • [1] Bat algorithm with triangle-flipping strategy for numerical optimization
    Cai, Xingjuan
    Wang, Hui
    Cui, Zhihua
    Cai, Jianghui
    Xue, Yu
    Wang, Lei
    [J]. INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2018, 9 (02) : 199 - 215
  • [2] Adaptive Bat Algorithm Optimization Strategy for Observation Matrix
    Cui, Zhihua
    Zhang, Chunmei
    Zhao, Yaru
    Shi, Zhentao
    [J]. APPLIED SCIENCES-BASEL, 2019, 9 (15):
  • [3] Improved Hybridized Bat Algorithm for Global Numerical Optimization
    Alihodzic, Adis
    Tuba, Milan
    [J]. 2014 UKSIM-AMSS 16TH INTERNATIONAL CONFERENCE ON COMPUTER MODELLING AND SIMULATION (UKSIM), 2014, : 57 - 62
  • [4] Bat Algorithm with Different Initialization Approaches for Numerical Optimization
    Rauf, Hafiz Tayyab
    Lali, M. Ikram Ullah
    Babar, Malik Hamdan
    Ali, Abdullah Safdar
    [J]. 2019 INTERNATIONAL CONFERENCE ON INNOVATION AND INTELLIGENCE FOR INFORMATICS, COMPUTING, AND TECHNOLOGIES (3ICT), 2019,
  • [5] Hybridizing cuckoo search algorithm with bat algorithm for global numerical optimization
    Shehab, Mohammad
    Khader, Hamad Tajudin
    Laouched, Makhlouf
    Alomari, Osama Ahmad
    [J]. JOURNAL OF SUPERCOMPUTING, 2019, 75 (05): : 2395 - 2422
  • [6] Hybridizing cuckoo search algorithm with bat algorithm for global numerical optimization
    Mohammad Shehab
    Ahamad Tajudin Khader
    Makhlouf Laouchedi
    Osama Ahmad Alomari
    [J]. The Journal of Supercomputing, 2019, 75 : 2395 - 2422
  • [7] An enhanced Bat algorithm with mutation operator for numerical optimization problems
    Waheed A. H. M. Ghanem
    Aman Jantan
    [J]. Neural Computing and Applications, 2019, 31 : 617 - 651
  • [8] A Novel Bat Algorithm with Multiple Strategies Coupling for Numerical Optimization
    Wang, Yechuang
    Wang, Penghong
    Zhang, Jiangjiang
    Cui, Zhihua
    Cai, Xingjuan
    Zhang, Wensheng
    Chen, Jinjun
    [J]. MATHEMATICS, 2019, 7 (02)
  • [9] New Modified Controlled Bat Algorithm for Numerical Optimization Problem
    Bangyal, Waqas Haider
    Hameed, Abdul
    Ahmad, Jamil
    Nisar, Kashif
    Haque, Muhammad Reazul
    Ibrahim, Ag. Asri Ag.
    Rodrigues, Joel J. P. C.
    Khan, M. Adil
    Rawat, Danda B.
    Etengu, Richard
    [J]. CMC-COMPUTERS MATERIALS & CONTINUA, 2022, 70 (02): : 2241 - 2259
  • [10] An enhanced Bat algorithm with mutation operator for numerical optimization problems
    Ghanem, Waheed A. H. M.
    Jantan, Aman
    [J]. NEURAL COMPUTING & APPLICATIONS, 2019, 31 (Suppl 1): : 617 - 651