A New Genetic Chaos Optimization Combination Method
Yadong Li
Abstract
Yadong Li
Abstract
Based on the analysis of the properties of genetic algorithm and chaos optimization algorithm, a new genetic chaos optimization combination algorithm is presented. The method not only solves the invalidation problem of chaos optimization algorithm in a large scale, but also increases the ability of local search and search precision. Then, the convergence of the algorithm is proved. In the end, this algorithm is applied to six test functions' optimization problem and the simulation shows that the algorithm is effective.
OpenAlex reports 12 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.
Based on the analysis of the properties of genetic algorithm and chaos optimization algorithm, a new genetic chaos optimization combination algorithm is presented. The method not only solves the invalidation problem of chaos optimization algorithm in a large scale, but also increases the ability of local search and search precision. Then, the convergence of the algorithm is proved. In the end, this algorithm is applied to six test functions' optimization problem and the simulation shows that the algorithm is effective.
Key concepts: CHAOS (operating system), Meta-optimization, Mathematical optimization, Convergence (economics), Optimization problem, Genetic algorithm, Test functions for optimization, Derivative-free optimization