An Age-structured Genetic Algorithm
Da Xu
Abstract
Da Xu
Abstract
Combined with natural laws and the method of genetic algorithms,an age structured genetic algorithm is presented.Different operations are conducted with different age unites in the method,and therefore the main problem in genetic algorithms--premature convergence--is overcome.In this way,the algorithm keeps the diversity of population,and thereby converges conveniently on global solutions.The settlement of premature convergence and the improvement on convergence are illustrated by some examples.
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.
Combined with natural laws and the method of genetic algorithms,an age structured genetic algorithm is presented.Different operations are conducted with different age unites in the method,and therefore the main problem in genetic algorithms--premature convergence--is overcome.In this way,the algorithm keeps the diversity of population,and thereby converges conveniently on global solutions.The settlement of premature convergence and the improvement on convergence are illustrated by some examples.
Key concepts: Premature convergence, Convergence (economics), Genetic algorithm, Mathematical optimization, Computer science, Algorithm, Cultural algorithm, Population