2007Harbin Gongcheng Daxue Xuebao/Journal of Harbin Engineering UniversityRequires access

An improved adaptive genetic algorithm and its application in function optimization

Sheng Liu

Open publisher page 18 citations

Abstract

To speed up convergence rates and resolve local convergence issues in traditional adaptive genetic algorithms,an improved adaptive genetic algorithm was developed.According to the concentrating degree of fitness of the populations,a kind of adaptive crossover probability and mutation probability were designed in terms of three variables of maximal fitness,minimal fitness and average fitness of the populations,whereby the crossover probabilities and mutation probabilities of the whole populations could be adjusted.Based on this,an improved adaptive genetic algorithm was developed.Simulation results prove that the new adaptive algorithm can converge faster than the unimproved algorithm and is highly effective at avoiding the premature convergence of the adaptive genetic algorithm.

About this research paper

What this paper is about

To speed up convergence rates and resolve local convergence issues in traditional adaptive genetic algorithms,an improved adaptive genetic algorithm was developed.According to the concentrating degree of fitness of the populations,a kind of adaptive crossover probability and mutation probability were designed in terms of three variables of maximal fitness,minimal fitness and average fitness of the populations,whereby the crossover probabilities and mutation probabilities of the whole populations could be adjusted.Based on this,an improved adaptive genetic algorithm was developed.Simulation results prove that the new adaptive algorithm can converge faster than the unimproved algorithm and is highly effective at avoiding the premature convergence of the adaptive genetic algorithm.

Why it matters

OpenAlex reports 18 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

To speed up convergence rates and resolve local convergence issues in traditional adaptive genetic algorithms,an improved adaptive genetic algorithm was developed.According to the concentrating degree of fitness of the populations,a kind of adaptive crossover probability and mutation probability were designed in terms of three variables of maximal fitness,minimal fitness and average fitness of the populations,whereby the crossover probabilities and mutation probabilities of the whole populations could be adjusted.Based on this,an improved adaptive genetic algorithm was developed.Simulation results prove that the new adaptive algorithm can converge faster than the unimproved algorithm and is highly effective at avoiding the premature convergence of the adaptive genetic algorithm.

Key concepts: Crossover, Genetic algorithm, Convergence (economics), Fitness function, Premature convergence, Mathematical optimization, Adaptive mutation, Mutation

Related papers

Back to paper searchBrowse research topicsOriginal source
An improved adaptive genetic algorithm and its application in function optimization — Research Paper | ScholarLens