返回
Artificial Bee Colony Algorithm with Distant Savants for constrained optimization
DOI:10.1016/j.asoc.2021.108343.png)
摘要
En 中文
Most of the scientific and engineering problems are defined as constrained optimization functions. It can be very difficult due to their complex structures. Artificial Bee Colony Algorithm (ABC) is a remarkable metaheuristic developed for global optimization problems. However, due to the inadequacy of ABC's search capability, it cannot handle constraint optimization problems very well. In this study, an ABC variant adapted for solving constrained optimization problems called Artificial Bee Colony Algorithm with Distant Savants (ABCDS) is proposed to overcome this deficiency. ABCDS is based on a new and adaptable search equation that enables learning with savants that are at a certain distance from each other. Also, the algorithm is hybridized with competitive local search mechanism. To test the performance of ABCDS, benchmark set for Constrained Real-Parameter Optimization defined in CEC 2017 conference (CEC2017COP) and some of the problems in the benchmark set on real-world problems defined in CEC 2020 conference (CEC2020) are used. The results obtained by the algorithm are compared with recent ABC algorithms and some state-of-the-art algorithms. According to the experimental results, ABCDS is better and competitive than the compared algorithms. (C) 2021 Elsevier B.V. All rights reserved.
Keyword:
Artificial Bee Colony
Constraint optimization
Distant Savants
Competitive local search
Incremental population size
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms关于使用非参数统计检验作为比较进化和群体智能算法的方法的实用教程
A novel metaheuristic method for solving constrained engineering optimization problems: Crow search algorithm一种求解约束工程优化问题的元启发式方法: 乌鸦搜索算法
Optimal operation of multi-reservoir system by multi-elite guide particle swarm optimization基于多精英引导粒子群算法的多水库系统优化调度

