By Topic

Simulated annealing genetic hybrid algorithm and its applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Huang Taishong ; Inf. Sci. & Eng. Coll., Cental South Univ. of Technol., Changsha, China ; Gui Weihua ; Yang Chunhua

Genetic algorithm (GA) search methods are rooted in evolution mechanisms and the nature of genetics. They have been applied to a wide range of industrial applications but research shows that standard genetic algorithms have some defects such as unsatisfactory local searching ability and premature convergence. The article proposes a genetic algorithm to overcome these shortcomings. The simulated result shows that the hybrid algorithm helps the practical system achieve a better performance

Published in:

Intelligent Control and Automation, 2000. Proceedings of the 3rd World Congress on  (Volume:1 )

Date of Conference:

2000