2008Journal of Kunming University of Science and TechnologyRequires access

A Hybrid Algorithm Based on Genetic Algorithm and Simulated Annealing Algorithm

Gao Cheng-xiu

Open publisher page 0 citations

Abstract

By embedding simulated annealing operator into genetic algorithm,a hybrid algorithm is put forward,which assimilates advantages of both genetic algorithm and simulated annealing algorithm.Penalty function is adopted to deal with constraint conditions.Specific genetic algorithm operators are also designed to construct fitness function.The optimal control of discrete time system is therefore realized.It is proved that this algorithm can converge not only quickly but also to the optimal solution.

About this research paper

What this paper is about

By embedding simulated annealing operator into genetic algorithm,a hybrid algorithm is put forward,which assimilates advantages of both genetic algorithm and simulated annealing algorithm.Penalty function is adopted to deal with constraint conditions.Specific genetic algorithm operators are also designed to construct fitness function.The optimal control of discrete time system is therefore realized.It is proved that this algorithm can converge not only quickly but also to the optimal solution.

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

By embedding simulated annealing operator into genetic algorithm,a hybrid algorithm is put forward,which assimilates advantages of both genetic algorithm and simulated annealing algorithm.Penalty function is adopted to deal with constraint conditions.Specific genetic algorithm operators are also designed to construct fitness function.The optimal control of discrete time system is therefore realized.It is proved that this algorithm can converge not only quickly but also to the optimal solution.

Key concepts: Algorithm, Simulated annealing, Genetic algorithm, Computer science, Hybrid algorithm (constraint satisfaction), Population-based incremental learning, Adaptive simulated annealing, Fitness function

Related papers

Back to paper searchBrowse research topicsOriginal source
A Hybrid Algorithm Based on Genetic Algorithm and Simulated Annealing Algorithm — Research Paper | ScholarLens