选择(遗传算法)
工作量
机制(生物学)
人工蜂群算法
计算机科学
机器学习
人工智能
数学优化
工程类
算法
数据挖掘
运筹学
数学
认识论
操作系统
哲学
作者
Jingyuan Yang,Jiangtao Cui,Xiaofang Xia,Xiyue Gao,Bo Yang,Yudong Zhang
标识
DOI:10.1016/j.cie.2024.109982
摘要
As one category of evolutionary algorithms, artificial bee colony (ABC) algorithms have many advantages such as few control parameters, simple structures and competitive performance. However, most ABC algorithms suffer from slow convergence and poor performance on optimization problems with strong correlations. To overcome these limitations, we propose a novel ABC with an Adaptive Search Strategy Selection (AS3) mechanism, called ABC-AS3. The basic idea of ABC-AS3 is to adaptively adjust search strategies between a one-dimensional search strategy and an all-dimensional search strategy based on probabilities that they are selected respectively within the most recent generations. We prove the rotation-variant and rotation-invariant properties of the one-dimensional and all-dimensional search strategies applied in the ABC-AS3 algorithm, respectively. The one-dimensional search strategy is used to maintain superiority on optimization with weak correlations. The all-dimensional one aims to accelerate the convergence speed and improve the performance on optimization with strong correlations. Simulation results show that ABC-AS3 outperforms state-of-the-art ABC variants and evolutionary algorithms in terms of solution quality, convergence speed, and numerical stability. In addition, we apply ABC-AS3 to optimize parameters of a multi-layer perceptron for workload prediction in data centers, which achieves better prediction accuracy and stability than baseline methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI