Efficiency speed-up strategies for evolutionary computation: fundamentals and fast-GAs - Liang Yong

Through identifying the main causes of low efficiency of the currently known evolutionary algorithms, a set of six efficiency speed-up strategies are suggested, analyzed, and partially explored, including those of the splicing/decomposable representation scheme, the exclusion-based selection operators, the “few-generation-ended” EC search, the “low-resolution” computation with reinitialization, and the coevolution-like decomposition. Incorporation of the strategies with any known evolutionary algorithm leads to an accelerated version of the algorithm. On the basis of problem space discretization, the proposed strategies accelerate evolutionary computation via a “best-so-far solution” guided, exclusion-based space-shrinking scheme. With this scheme, an arbitrarily high-precision (resolution) solution of a high-dimensional problem can be obtained by means of a successive low-resolution search in low-dimensional …