Efficiency speed-up strategies for evolutionary computation: Fundamentals and fast-GAs

Abstract

The efficiency speed-up strategies for evolutionary computation were discussed. Incorporation of the strategies with any known evolutionary algorithm leads to an accelerated version of the algorithm. An arbitrarily high-precision (resolution) solution of a high-dimensional problem was obtained by means of a successive low-resolution search in low-dimensional search spaces. The fast-genetic algorithms were experimentally tested with a test suit containing 10 complex multimodal function optimization problems.