维数(图论)
选择(遗传算法)
水准点(测量)
数学优化
趋同(经济学)
排名(信息检索)
计算机科学
收敛速度
人工智能
人工蜂群算法
机器学习
钥匙(锁)
适应性策略
数学
进化计算
变化(天文学)
适应(眼睛)
数据挖掘
组分(热力学)
动平衡
作者
Yang Cao,Xiaoquan Yuan,Jingzheng Luan
出处
期刊:Mathematics
[Multidisciplinary Digital Publishing Institute]
日期:2026-09-28
卷期号:14 (19): 3521-3521
摘要
The Artificial Bee Colony (ABC) algorithm demonstrates strong exploration but converges slowly. To address this, AMRABC_Ts introduces an adaptive dimension modification rate mechanism with two search strategies. The exploration-favoured CABC strategy uses random guidance, while the exploitation-favoured MABC_order strategy employs ranking information from elite solutions. These strategies are dynamically selected based on improvement feedback to maintain search balance throughout evolution. Dimension modification rates are chosen according to historical success rates to accelerate convergence. Tests on 22 benchmark functions and CEC2014 problems show that AMRABC_Ts performs competitively against existing ABC variants at different dimensions, with notable strength on composition functions. The results validate improvements in convergence speed and solution accuracy, demonstrating the effectiveness of combining adaptive strategy selection with dimension modification.
科研通智能强力驱动
Strongly Powered by AbleSci AI