Artificial Bee Colony Algorithm Based on Ensemble of Constraint Handing Techniques

摘要

Artificial Bee Colony (ABC) Algorithm was firstly proposed for unconstrained optimization problems. Later many constraint processing techniques have been developed for ABC algorithms. According to the no free lunch theorem, it is impossible for a single constraint technique to be better than any other constraint technique on every issue. In this paper, artificial bee colony (ABC) algorithm with ensemble of constraint handling techniques (ECHT- ABC) is proposed to solve the constraint optimization problems. The performance of ECHT-ABC has been tested on 28 benchmark test functions for CEC 2017 Competition on Constrained Real-Parameter Optimization. The experimental results demonstrate that ECHT-ABC obtains very competitive performance compared with other state-of-the-art methods for constrained evolutionary optimization.