A Hybrid Algorithm Based on Genetic Algorithm and Simulated Annealing Algorithm
Gao Cheng-xiu
Abstract
Gao Cheng-xiu
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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