A Decomposition-Based Many-Objective Artificial Bee Colony Algorithm.

In this paper, a decomposition-based artificial bee colony (ABC) algorithm is proposed to handle many-objective optimization problems (MaOPs). In the proposed algorithm, an MaOP is converted into a number of subproblems which are simultaneously optimized by a modified ABC algorithm. The hybrid of the decomposition-based algorithm and the ABC algorithm can make full use of the advantages of both algorithms. The former, with the help of a set of weight vectors, is able to maintain a good diversity among solutions, while the latter, with a fast convergence speed, is highly effective when solving a scalar optimization problem. Therefore, the convergence and diversity would be well balanced in the new algorithm. Moreover, subproblems in the proposed algorithm are handled unequally, and computational resources are dynamically allocated through specially designed onlooker bees and scout bees. The proposed algorithm is compared with five state-of-the-art many-objective evolutionary algorithms on 13 test problems with up to 50 objectives. It is shown by the experimental results that the proposed algorithm performs better than or comparably to other algorithms in terms of both quality of the final solution set and efficiency of the algorithms. Finally, as shown by the Wilcoxon signed-rank test results, the onlooker bees and scout bees indeed contribute to performance improvements of the algorithm. Given the high quality of solutions and the rapid running speed, the proposed algorithm could be a promising tool when approximating a set of well-converged and properly distributed nondominated solutions for MaOPs.