Gene Targeting Differential Evolution: A Simple and Efficient Method for Large-Scale Optimization

Large-scale optimization problems (LSOPs) are challenging because the algorithm is difficult in balancing too many dimensions and in escaping from trapped bottleneck dimensions. To improve solutions, this article introduces targeted modification to the certain values in the bottleneck dimensions. Analogous to gene targeting (GT) in biotechnology, we experiment on targeting the specific genes in the candidate solution to improve its trait in differential evolution (DE). We propose a simple and efficient method, called GT-based DE (GTDE), to solve LSOPs. In the algorithm design, a simple GT-based modification is developed to perform on the best individual, comprising probabilistically targeting the location of bottleneck dimensions, constructing a homologous targeting vector, and inserting the targeting vector into the best individual. In this way, all the bottleneck dimensions of the best individual can be probabilistically targeted and modified to break the bottleneck and to provide global guidance for more optimal evolution. Note that the GT is only performed on the globally best individual and is just carried out as a simple operator that is added to the standard DE. Experimental studies compare the GTDE with some other state-of-the-art large-scale optimization algorithms, including the winners of CEC2010, CEC2012, CEC2013, and CEC2018 competitions on large-scale optimization. The results show that the GTDE is efficient and performs better than or at least comparable to the others in solving LSOPs.

Automated summary

This article proposes a method called GT-based DE to solve large-scale optimization problems by targeting and modifying certain values in bottleneck dimensions. Experimental results show that GTDE is efficient and performs better or at least comparable to other state-of-the-art algorithms in solving LSOPs.