2014•Journal of Computer ApplicationsRequires access

Genetic algorithm parameter tuning based on simulated annealing

Ru Fang

Open publisher page 0 citations

Abstract

Through analysis of the essence of genetic algorithm parameter tuning and weigh the pros and cons of various meta-heuristics, a genetic algorithm parameters optimization scheme based on simulated annealing was proposed in this paper.The purpose of this paper is to choose parameters which having high quality for genetic algorithm, to improve the performance of genetic algorithm instance. In the experimental section, comprehensive test method was selected as control group. It verified that if using the parameters getting from this algorithm, genetic algorithm instance can fast convergence and can get high quality solutions. The ability of genetic algorithm solving optimization problems can be greatly improved by the algorithm proposed in this paper.

About this research paper

What this paper is about

Through analysis of the essence of genetic algorithm parameter tuning and weigh the pros and cons of various meta-heuristics, a genetic algorithm parameters optimization scheme based on simulated annealing was proposed in this paper.The purpose of this paper is to choose parameters which having high quality for genetic algorithm, to improve the performance of genetic algorithm instance. In the experimental section, comprehensive test method was selected as control group. It verified that if using the parameters getting from this algorithm, genetic algorithm instance can fast convergence and can get high quality solutions. The ability of genetic algorithm solving optimization problems can be greatly improved by the algorithm proposed in this paper.

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

Through analysis of the essence of genetic algorithm parameter tuning and weigh the pros and cons of various meta-heuristics, a genetic algorithm parameters optimization scheme based on simulated annealing was proposed in this paper.The purpose of this paper is to choose parameters which having high quality for genetic algorithm, to improve the performance of genetic algorithm instance. In the experimental section, comprehensive test method was selected as control group. It verified that if using the parameters getting from this algorithm, genetic algorithm instance can fast convergence and can get high quality solutions. The ability of genetic algorithm solving optimization problems can be greatly improved by the algorithm proposed in this paper.

Key concepts: Genetic algorithm, Simulated annealing, Computer science, Meta-optimization, Population-based incremental learning, Algorithm, Adaptive simulated annealing, Heuristics

Related papers

Back to paper searchBrowse research topicsOriginal source
Genetic algorithm parameter tuning based on simulated annealing — Research Paper | ScholarLens