An improved genetic algorithm-The disturbance genetic algorithm
Yong Liu
Abstract
Yong Liu
Abstract
In order to solve the problem of low precision and premature convergence of standard genetic algorithm which is based on binary number coding, an improved genetic algorithm called disturbance genetic algorithm (DGA) is presented,and the searching capability of the algorithm is improved by disturbing the search zone slightly. With the improved algorithm,the multiple hump function can be dealt with efficiently and the goal of global convergence achieved. The design and structure of the improved genetic algorithm are discussed in this paper. The effectiveness of the improved genetic algorithm is also analyzed.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In order to solve the problem of low precision and premature convergence of standard genetic algorithm which is based on binary number coding, an improved genetic algorithm called disturbance genetic algorithm (DGA) is presented,and the searching capability of the algorithm is improved by disturbing the search zone slightly. With the improved algorithm,the multiple hump function can be dealt with efficiently and the goal of global convergence achieved. The design and structure of the improved genetic algorithm are discussed in this paper. The effectiveness of the improved genetic algorithm is also analyzed.
Key concepts: Population-based incremental learning, Genetic algorithm, Algorithm, Cultural algorithm, Meta-optimization, Coding (social sciences), Convergence (economics), Premature convergence