As an emerging swarm intelligence optimization algorithm, the Tumbleweed Algorithm (TA) has demonstrated remarkable performance in solving complex global optimization problems. This study proposes an improved Dynamic Cauchy Tumbleweed Algorithm (DCTA), which significantly enhances the optimization performance by incorporating a Cauchy Mutation strategy and an adaptive parameter mechanism. A systematic evaluation is conducted using the CEC2017 benchmark test function set, with experiments performed in 10-, 30-, and 50-dimensional search spaces. The experimental design includes comparative experiments with the original TA algorithm, four classical swarm intelligence optimization algorithms in the literature, and two swarm intelligence algorithms that have shown excellent performance in recent years. The results demonstrate that DCTA possesses significant advantages in solving high-dimensional complex optimization problems.

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

DCTA: Dynamic Cauchy Tumbleweed Algorithm

  • Jeng-Shyang Pan,
  • Chang-Qi Xu,
  • Zhi Li,
  • Lin Xu,
  • Ruo-Bin Wang,
  • Shu-Chuan Chu

摘要

As an emerging swarm intelligence optimization algorithm, the Tumbleweed Algorithm (TA) has demonstrated remarkable performance in solving complex global optimization problems. This study proposes an improved Dynamic Cauchy Tumbleweed Algorithm (DCTA), which significantly enhances the optimization performance by incorporating a Cauchy Mutation strategy and an adaptive parameter mechanism. A systematic evaluation is conducted using the CEC2017 benchmark test function set, with experiments performed in 10-, 30-, and 50-dimensional search spaces. The experimental design includes comparative experiments with the original TA algorithm, four classical swarm intelligence optimization algorithms in the literature, and two swarm intelligence algorithms that have shown excellent performance in recent years. The results demonstrate that DCTA possesses significant advantages in solving high-dimensional complex optimization problems.