Contribution Based Co-Evolutionary Algorithm for Large-Scale Optimization Problems

The solution of large-scale optimization problems is the key to many decision-making processes in practice. However, it is a challenging research topic when considered both the quality of solutions and the required computational time. One of the popular approaches for these problems is to divide the problems into a number of smaller sub-problems, that are then solved separately with an exchange of some information using the cooperative co-evolution (CC) concept. However, the characteristics of sub-components could be different, and their contributions to the overall performance can also be different while solving the problem. In the CC approach, it usually applies one optimizer and allocates equal computational budget to all sub-components. In this article, a new algorithm is proposed with the use of multiple optimizers, along with a need-based allocation of computational budget for the sub-components. In the proposed algorithm, a group of optimizers cooperate in an effective way to evolve the sub-components, depending on heuristic fuzzy rules. The performance of our proposed algorithm was evaluated by solving a number of large-scale global optimization benchmark functions. The empirical results show that the proposed algorithm outperforms equal allocation CC, a single selection characteristic, a single candidate optimizer and state-of-the-art algorithms.