Genetic Algorithm with Age Structure
Yan Yang
Abstract
Yan Yang
Abstract
In this paper,a novel genetic algorithm with age structure is proposed. Standard genetic algorithm has been successfully applied to many evolutionary optimization problems. But there is a problem of premature convergence for complex multi-model functions . To solve the problem,the genetic algorithm with age structure is presented referring natural laws and the method of genetic algorithms. 1This genetic algorithm can combat premature convergence and keep the diversity of population through different operation with different age units,and thereby converge conveniently on global solutions.
OpenAlex reports 1 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.
In this paper,a novel genetic algorithm with age structure is proposed. Standard genetic algorithm has been successfully applied to many evolutionary optimization problems. But there is a problem of premature convergence for complex multi-model functions . To solve the problem,the genetic algorithm with age structure is presented referring natural laws and the method of genetic algorithms. 1This genetic algorithm can combat premature convergence and keep the diversity of population through different operation with different age units,and thereby converge conveniently on global solutions.
Key concepts: Premature convergence, Genetic algorithm, Convergence (economics), Cultural algorithm, Genetic representation, Population-based incremental learning, Mathematical optimization, Computer science