Scholarlink

<p>This paper proposes a novel metaheuristic algorithm-the Power Method Algorithm (PMA), which is inspired by the power iteration method to solve complex optimization problems. PMA simulates the process of computing dominant eigenvalues and eigenvectors, incorporating strategies such as stochastic angle generation and adjustment factors, effectively addressing eigenvalue problems in large sparse matrices. The algorithm is rigorously evaluated on 49 benchmark functions from the CEC 2017 and CEC 2022 test suites. Quantitative analysis reveals that PMA surpasses nine state-of-the-art metaheuristic algorithms and performs better, with average Friedman rankings of 3, 2.71, and 2.69 for 30, 50, and 100 dimensions, respectively. Statistical tests including the Wilcoxon rank-sum and Friedman test further confirm the robustness and reliability. Additionally, PMA demonstrates exceptional performance in solving eight real-world engineering optimization problems, consistently delivering optimal solutions. Experimental results show that PMA achieves an effective balance between exploration and exploitation, effectively avoiding local optima while maintaining high convergence efficiency. Therefore, PMA demonstrates notable competitiveness and practical value in interdisciplinary complex optimization tasks.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A novel transcendental metaphor metaheuristic algorithm based on power method

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年7月24日

查看全文
  • Huiying Zhang,
  • Hanshuo Wu,
  • Yifei Gong,
  • Xiao Pan,
  • Qipeng Zhong

摘要

This paper proposes a novel metaheuristic algorithm-the Power Method Algorithm (PMA), which is inspired by the power iteration method to solve complex optimization problems. PMA simulates the process of computing dominant eigenvalues and eigenvectors, incorporating strategies such as stochastic angle generation and adjustment factors, effectively addressing eigenvalue problems in large sparse matrices. The algorithm is rigorously evaluated on 49 benchmark functions from the CEC 2017 and CEC 2022 test suites. Quantitative analysis reveals that PMA surpasses nine state-of-the-art metaheuristic algorithms and performs better, with average Friedman rankings of 3, 2.71, and 2.69 for 30, 50, and 100 dimensions, respectively. Statistical tests including the Wilcoxon rank-sum and Friedman test further confirm the robustness and reliability. Additionally, PMA demonstrates exceptional performance in solving eight real-world engineering optimization problems, consistently delivering optimal solutions. Experimental results show that PMA achieves an effective balance between exploration and exploitation, effectively avoiding local optima while maintaining high convergence efficiency. Therefore, PMA demonstrates notable competitiveness and practical value in interdisciplinary complex optimization tasks.