2009Computer Engineering and Applications JournalRequires access

Improvement and application of adaptive genetic algorithm in feature selection

Zhenfang Zhu

Open publisher page 1 citations

Abstract

To overcome global situation problem tradition genetic algorithm has very strong robustness in finding the solution,but crossover probability and mutation probability is fixed and invariable,it caused premature convergence and running inefficient to the solution on complicated problem at later evolution process of tradition genetic algorithm.To this problem,an adaptive genetic algorithm is proposed with varying population size based on lifetimes of the chromosomes to realize population size adjust adaptively and crossover probability adjust adaptively and mutation probability adjust adaptively.Experimental results show that the approach proposed is effective in the capability of global optimization and significantly improves the convergence rate.

About this research paper

What this paper is about

To overcome global situation problem tradition genetic algorithm has very strong robustness in finding the solution,but crossover probability and mutation probability is fixed and invariable,it caused premature convergence and running inefficient to the solution on complicated problem at later evolution process of tradition genetic algorithm.To this problem,an adaptive genetic algorithm is proposed with varying population size based on lifetimes of the chromosomes to realize population size adjust adaptively and crossover probability adjust adaptively and mutation probability adjust adaptively.Experimental results show that the approach proposed is effective in the capability of global optimization and significantly improves the convergence rate.

Why it matters

OpenAlex reports 1 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 overcome global situation problem tradition genetic algorithm has very strong robustness in finding the solution,but crossover probability and mutation probability is fixed and invariable,it caused premature convergence and running inefficient to the solution on complicated problem at later evolution process of tradition genetic algorithm.To this problem,an adaptive genetic algorithm is proposed with varying population size based on lifetimes of the chromosomes to realize population size adjust adaptively and crossover probability adjust adaptively and mutation probability adjust adaptively.Experimental results show that the approach proposed is effective in the capability of global optimization and significantly improves the convergence rate.

Key concepts: Crossover, Genetic algorithm, Robustness (evolution), Premature convergence, Population, Computer science, Mathematical optimization, Convergence (economics)

Related papers

Back to paper searchBrowse research topicsOriginal source
Improvement and application of adaptive genetic algorithm in feature selection — Research Paper | ScholarLens