An improved structure of genetic algorithms for global optimisation

Abstract

Genetic Algorithm (GA) is one of the most general global optimisation solution methods used in countless number of works. However, like other search techniques, GA has weak theoretical guarantee of global optimal solution and can only offer a probabilistic guarantee. Having a GA capable of searching for the global optimal solution with very high success probability is always desirable. In this paper, an innovative structure of GA, in which adaptive restarting and chromosome elite transferring strategies are harmoniously integrated together, is proposed to improve the success rate of achieving global optimal solution of the algorithm. The robustness of the proposed GA structure is demonstrated through a number of case studies.