2009•Hebei Journal of Industrial Science and TechnologyRequires access

New algorithm for a non-linear programming problem based on adaptive genetic algorithm

Gao Juan

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Crossover, Algorithm, Genetic algorithm, Mutation, Computer science, Genetic programming, Population-based incremental learning, Linear programming

Related papers

Back to paper searchBrowse research topicsOriginal source
New algorithm for a non-linear programming problem based on adaptive genetic algorithm — Research Paper | ScholarLens