Natural Genetic Algorithm and Its Performance Analysis
Li G
Abstract
Li G
Abstract
There are three difficult problems in the application of genetic algorithm, namely the parameter control, the premature convergence and the deception problem. Based on genetic algorithm with varying population size, a self adaptive genetic algorithm called natural genetic algorithm (nGA) is proposed. It introduces the population size threshold and the immigrant concepts, and adopts dynamically changing parameters in this paper. The design and structure of the nGA are discussed, and the performance of nGA is also analyzed.
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.
There are three difficult problems in the application of genetic algorithm, namely the parameter control, the premature convergence and the deception problem. Based on genetic algorithm with varying population size, a self adaptive genetic algorithm called natural genetic algorithm (nGA) is proposed. It introduces the population size threshold and the immigrant concepts, and adopts dynamically changing parameters in this paper. The design and structure of the nGA are discussed, and the performance of nGA is also analyzed.
Key concepts: Genetic algorithm, Premature convergence, Quality control and genetic algorithms, Cultural algorithm, Computer science, Algorithm, Convergence (economics), Population-based incremental learning