An Improved Real-value Adaptive Genetic Algorithm
Wei Pan, Diao Huazong
Abstract
Wei Pan, Diao Huazong
Abstract
The improvement problem of genetic algorithm is studied based on real coding.To the shortcomings that: the search is inefficient and it is easy to premature convergence,the parameter adjusting problem of genetic algorithm is discussed.The adaptive crossover probability and adaptive mutation probability are proposed,considering the influence of every generation to algorithm and the effect of different individual fitness in every generation.Three testing functions are used to validate the algorithm.The results thaw that the ultimate value,the average algebraic sum and the convergence probability all obtain the preferable values.
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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.
The improvement problem of genetic algorithm is studied based on real coding.To the shortcomings that: the search is inefficient and it is easy to premature convergence,the parameter adjusting problem of genetic algorithm is discussed.The adaptive crossover probability and adaptive mutation probability are proposed,considering the influence of every generation to algorithm and the effect of different individual fitness in every generation.Three testing functions are used to validate the algorithm.The results thaw that the ultimate value,the average algebraic sum and the convergence probability all obtain the preferable values.
Key concepts: Crossover, Premature convergence, Coding (social sciences), Algorithm, Convergence (economics), Genetic algorithm, Mathematical optimization, Computer science