Font Size: a A A

The Research Of Fast And Effective Convergence Of Genetic Algorithm

Posted on:2008-12-20Degree:MasterType:Thesis
Country:ChinaCandidate:X L ZhuFull Text:PDF
GTID:2178360215479839Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Genetic algorithm based on the principle of efficient search and genetic technology has been successfully applied in engineering design, business management and other areas of scientific experiments to solve complex optimization problems. However, in the process of search of global solution, the diversity gradually diminishes to zero. Convergence, more often, divert to the local solution, causing premature convergence. In fact, lots of works in genetic algorithm solve the problem of premature convergence. The solution could be broadly divided into three categories: 1) increasing the population size, 2) static or dynamic adjustment of crossover and mutation probability, 3) adding other operator. In this paper, several genetic algorithms efficiently maintaining diversity are analyzed. Two new kinds of genetic algorithm is given out, and the experimental testing is carried out. The main important work of this paper includes:(1) Deeply study the basic theory of niche, mutation operator, parallel genetic algorithm, how to efficiently maintain the diversity of genetic algorithm and premature convergence.(2) Basing on the characteristic of enhancing population diversity of niche and mutation operator, a sharing mutation algorithm is proposed, the algorithm efficiently maintains population diversity, prevent premature, and guide the mutation course, accelerate convergence. Applying a new method avoid the hard problem that determine the radius of niche. Simulation on benchmark function shows that the algorithm greatly improves the global efficiency.(3) Considering the possibility of inhabiting the premature convergence, a parallel genetic algorithms based on building block migration is proposed. Relying on convergence situation, get unlapped building block from other population. Using simulated annealing method prevent the density of good schema increase greatly resulting in premature convergence. Theory analysis and experimental results show that the method not only reduce ineffective migration and decrease communication costs, but also lower the possibility of occurring premature and assure the capability of global convergence.
Keywords/Search Tags:Genetic Algorithm, Premature Convergence, Sharing Mutation, Schema Theory, Migration Strategy
PDF Full Text Request
Related items