Improvement and application of an adaptive simulated annealing genetic algorithm
Li Huang
Abstract
Li Huang
Abstract
The paper analyses the major merits and shortcomings of these two algorithms and proposes an improved adaptive simulated annealing genetic algorithm.The algorithm combines the simulated annealing algorithm with the genetic algorithm and takes advantage of the feature that simulated annealing algorithm has the excellent ability of local searching,to overcome the defect of slow convergence rate and enhance the ability of seeking the global excellent result.The experiment results prove the efficiency of the hybrid algorithm.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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.
The paper analyses the major merits and shortcomings of these two algorithms and proposes an improved adaptive simulated annealing genetic algorithm.The algorithm combines the simulated annealing algorithm with the genetic algorithm and takes advantage of the feature that simulated annealing algorithm has the excellent ability of local searching,to overcome the defect of slow convergence rate and enhance the ability of seeking the global excellent result.The experiment results prove the efficiency of the hybrid algorithm.
Key concepts: Simulated annealing, Adaptive simulated annealing, Computer science, Algorithm, Genetic algorithm, Hybrid algorithm (constraint satisfaction), Rate of convergence, Annealing (glass)