A proposed Whale Search Algorithm with Adaptive Random Walk

被引:0
|
作者
Emary, E. [1 ,2 ]
Zawbaa, Hossam M. [3 ,4 ]
Salam, Mustafa Abdul [5 ]
机构
[1] Cairo Univ, Fac Comp & Informat, Giza, Egypt
[2] Arab Open Univ, Fac Comp Studies, Cairo, Egypt
[3] Beni Suef Univ, Fac Comp & Informat, Bani Suwayf, Egypt
[4] Babes Bolyai Univ, Fac Math & Comp Sci, Cluj Napoca, Romania
[5] Benha Univ, Fac Comp & Informat, Banha, Egypt
关键词
Whale Optimization Algorithm; Adaptive random walk; Adaptive Whale optimization algorithm; Bio-inspired optimization; Evolutionary Computation;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, a variant of the recently introduced whale optimization algorithm (WOA) was proposed based on adaptive switching of random walk per individual search agent. WOA is recently proposed bio-inspired optimizers that employ two different random walks. The original optimizer stochastically switches between the two random walk at each iteration regardless of the search agents performance and regardless of the fitness terrain around it. In the proposed adaptive walk whale optimization algorithm (AWOA), an adaptive switching between the two random walk is recommended based on the agent's performance. Moreover, a random explorative switch of the walk is applied to allow search agents to try different walks. The proposed AWOA was benchmarked using 29 standard test functions with uni-modal, multi-modal, and composite test functions. Performance over such functions proves the capability of the proposed variant to outperform the original WOA.
引用
下载
收藏
页码:171 / 177
页数:7
相关论文
共 50 条
  • [31] A random walk on rectangles algorithm
    Deaconu, M
    Lejay, A
    METHODOLOGY AND COMPUTING IN APPLIED PROBABILITY, 2006, 8 (01) : 135 - 151
  • [32] A Random Walk Analysis of Search in Metaheuristics
    Chen, Stephen
    Islam, Shehnaz
    Bolufe-Rohler, Antonio
    Montgomery, James
    Hendtlass, Tim
    2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, : 2323 - 2330
  • [33] Screening - a random walk or directed search?
    Seal, Ken
    Bolbot, John
    Best, David
    Proceedings of Biotechnology, 1988,
  • [34] SEARCH FOR THE MAXIMUM OF A RANDOM-WALK
    ODLYZKO, AM
    RANDOM STRUCTURES & ALGORITHMS, 1995, 6 (2-3) : 275 - 295
  • [35] UNSTRUCTURED SEARCH BY RANDOM AND QUANTUM WALK
    Wong, Thomas G.
    QUANTUM INFORMATION & COMPUTATION, 2022, 22 (1-2) : 53 - 85
  • [36] SEARCH FOR THE MAXIMUM OF A RANDOM-WALK
    ODLYZKO, AM
    ADVANCES IN APPLIED PROBABILITY, 1992, 24 (04) : 768 - 768
  • [37] UNSTRUCTURED SEARCH BY RANDOM AND QUANTUM WALK
    Wong T.G.
    Quantum Information and Computation, 2022, 22 (1-2): : 53 - 85
  • [38] Adaptive random search with intensification and diversification combined with genetic algorithm
    Sohn, DK
    Hirasawa, K
    Hu, JL
    2005 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-3, PROCEEDINGS, 2005, : 1462 - 1469
  • [39] Adaptive Random Search with Intensification and Diversification Combined with Genetic Algorithm
    Sohn, Dongkyu
    Hatakeyama, Hiroyuki
    Mabu, Shingo
    Hirasawa, Kotaro
    Hu, Jinglu
    JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS, 2006, 10 (06) : 921 - 930
  • [40] Effects of systematic phase errors on optimized quantum random-walk search algorithm
    Zhang Yu-Chao
    Bao Wan-Su
    Wang Xiang
    Fu Xiang-Qun
    CHINESE PHYSICS B, 2015, 24 (06)