Hierarchical Manta Ray Foraging Optimization with Weighted Fitness-Distance Balance Selection

被引:7
作者
Tang, Zhentao [1 ]
Wang, Kaiyu [2 ]
Tao, Sichen [2 ]
Todo, Yuki [3 ]
Wang, Rong-Long [4 ]
Gao, Shangce [2 ]
机构
[1] Jiangsu Agrianim Husb Vocat Coll, Taizhou 225300, Peoples R China
[2] Univ Toyama, Fac Engn, Toyama 9308555, Japan
[3] Kanazawa Univ, Fac Elect Informat & Commun Engn, Kanazawa 9201192, Japan
[4] Univ Fukui, Fac Engn, Fukui 9108507, Japan
基金
日本学术振兴会; 日本科学技术振兴机构;
关键词
Manta ray foraging optimization; Local optima; Population diversity; Hierarchical structure; Greedy selection; Weighted fitness-distance balance selection; Algorithm complexity; ALGORITHM; INTELLIGENCE; TESTS;
D O I
10.1007/s44196-023-00289-4
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Manta ray foraging optimization (MRFO) tends to get trapped in local optima as it relies on the direction provided by the previous individual and the best individual as guidance to search for the optimal solution. As enriching population diversity can effectively solve this problem, in this paper, we introduce a hierarchical structure and weighted fitness-distance balance selection to improve the population diversity of the algorithm. The hierarchical structure allows individuals in different groups of the population to search for optimal solutions in different places, expanding the diversity of solutions. In MRFO, greedy selection based solely on fitness can lead to local solutions. We innovatively incorporate a distance metric into the selection strategy to increase selection diversity and find better solutions. A hierarchical manta ray foraging optimization with weighted fitness-distance balance selection (HMRFO) is proposed. Experimental results on IEEE Congress on Evolutionary Computation 2017 (CEC2017) functions show the effectiveness of the proposed method compared to seven competitive algorithms, and the proposed method has little effect on the algorithm complexity of MRFO. The application of HMRFO to optimize real-world problems with large dimensions has also obtained good results, and the computational time is very short, making it a powerful alternative for very high-dimensional problems. Finally, the effectiveness of this method is further verified by analyzing the population diversity of HMRFO.
引用
收藏
页数:30
相关论文
共 85 条
  • [1] A Grunwald-Letnikov based Manta ray foraging optimizer for global optimization and image segmentation
    Abd Elaziz, Mohamed
    Yousri, Dalia
    Al-qaness, Mohammed A. A.
    AbdelAty, Amr M.
    Radwan, Ahmed G.
    Ewees, Ahmed A.
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2021, 98
  • [2] Reptile Search Algorithm (RSA): A nature-inspired meta-heuristic optimizer
    Abualigah, Laith
    Abd Elaziz, Mohamed
    Sumari, Putra
    Geem, Zong Woo
    Gandomi, Amir H.
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2022, 191
  • [3] Advances in Sine Cosine Algorithm: A comprehensive survey
    Abualigah, Laith
    Diabat, Ali
    [J]. ARTIFICIAL INTELLIGENCE REVIEW, 2021, 54 (04) : 2567 - 2608
  • [4] A Comprehensive Survey of the Harmony Search Algorithm in Clustering Applications
    Abualigah, Laith
    Diabat, Ali
    Geem, Zong Woo
    [J]. APPLIED SCIENCES-BASEL, 2020, 10 (11):
  • [5] Salp swarm algorithm: a comprehensive survey
    Abualigah, Laith
    Shehab, Mohammad
    Alshinwan, Mohammad
    Alabool, Hamzeh
    [J]. NEURAL COMPUTING & APPLICATIONS, 2020, 32 (15) : 11195 - 11215
  • [6] The exploration/exploitation tradeoff in dynamic cellular genetic algorithms
    Alba, E
    Dorronsoro, B
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2005, 9 (02) : 126 - 142
  • [7] A novel stochastic fractal search algorithm with fitness-Distance balance for global numerical optimization
    Aras, Sefa
    Gedikli, Eyup
    Kahraman, Hamdi Tolga
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2021, 61
  • [8] Arnold DV, 2002, IEEE T EVOLUT COMPUT, V6, P30, DOI [10.1109/4235.985690, 10.1023/A:1015059928466]
  • [9] Awad N., 2016, Problem Definitions and Evaluation Criteria for the CEC 2017 Competition and Special Session on Constrained Single Objective Real-Parameter Optimization
  • [10] Graph-based relevancy-redundancy gene selection method for cancer diagnosis
    Azadifar, Saeid
    Rostami, Mehrdad
    Berahmand, Kamal
    Moradi, Parham
    Oussalah, Mourad
    [J]. COMPUTERS IN BIOLOGY AND MEDICINE, 2022, 147