New algorithm for a non-linear programming problem based on adaptive genetic algorithm
Gao Juan
Abstract
Gao Juan
Abstract
The traditional methods to answer the question of non-linear programming have some limitations in its access to local optimum,low efficiency,and even no results obtained.And genetic algorithm with the same probability of crossover and mutation probability to control the evolution very easily lead to early maturity and reduce the efficiency of the algorithm.The crossover probability and mutation probability should be adjusted automatically According to fitness,thus a new genetic algorithm was proposed.Simulation results for six test functions,show that the new algorithm proposed in this paper is very effective.
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.
The traditional methods to answer the question of non-linear programming have some limitations in its access to local optimum,low efficiency,and even no results obtained.And genetic algorithm with the same probability of crossover and mutation probability to control the evolution very easily lead to early maturity and reduce the efficiency of the algorithm.The crossover probability and mutation probability should be adjusted automatically According to fitness,thus a new genetic algorithm was proposed.Simulation results for six test functions,show that the new algorithm proposed in this paper is very effective.
Key concepts: Crossover, Algorithm, Genetic algorithm, Mutation, Computer science, Genetic programming, Population-based incremental learning, Linear programming