Genetic Algorithm Combined with Automatic Termination and Search Space Rotation

摘要

Recently numerous evolutionary algorithms (EAs) have been developed for solving optimization problems. However, only a few works are concerned with the question of the termination criteria. In this work, we develop a genetic algorithm (GA) with automatic termination and acceleration elements which allow the search to end automatically without predefined conditions. We call this algorithm “Genetic Algorithm with Automatic Termination and Search Space Rotation”, abbreviated as GATR. This algorithm utilizes the so-called “Gene Matrix” (GM) to equip the search process with a self-check in order to judge how much exploration has been performed, while maintaining the population diversity. GATR also implements a novel search space decomposition mechanism combined with a search space rotation procedure. The computational experiments and comparisons with some state-of-the-art EAs demonstrate the effectiveness of the automatic termination criteria and the space decomposition mechanism.