Hybrid Evolutionary Algorithm for Solving the Large-Scale Global Optimization Problems

Abstract

When solving applied problems in various areas of human activity, the need appears to find the best set of parameters according to the given criterion. Usually such a problem is being formulated as a parametric optimization problem. The paper considers optimization problems represented by the black-box model. As such problems dimension grows, it becomes difficult to find a satisfactory solution for many traditional optimization approaches even with a significant increase in the number of objective function calculations. A new hybrid evolutionary method in coordinating the self-adjusting coevolution algorithms with the COSACC-LS1 local search is proposed to solve the problems of global material optimization of the extra-large dimension. COSACC-LS1 is based on the idea of the computing resources automatic allocation between a group of self-tuning differential evolution algorithms based on coevolution and local search algorithm. Effectiveness of the proposed algorithm was evaluated on 15 reference test problems from the LSGO CE 2013 set. Results of the COSACC-LS1-based algorithm were compared with a number of modern metaheuristic algorithms that were designed specifically for solving the very large-scale optimization problems and were the winners and prize-winners in the optimization competitions conducted within the framework of the IEEE CEC. With the help of numerical experiments, it is demonstrated that the proposed algorithm is better than most other popular algorithms according to the average accuracy criterion of the solution found