By Topic

A new optimization algorithm based on improved simulated annealing and genetic algorithm

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
$33 $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

1 Author(s)
Huawei Yi ; Computer Center, Laoning University of Technology, Jinzhou, Liaoning Province, China

A new Genetic Algorithm was proposed based on the analysis of the advantages and disadvantages of the Genetic Algorithm and Simulated Annealing Algorithm. The genetic algorithm with optimum reservation strategy was served as the main flow of the new algorithm which combined the mechanism of improved simulated annealing. In order to get the global optimum solution, the improved simulated annealing took the double threshold value and kept the middle optimum solution to reduce the computing capacity and enhanced the convergence speed. Through the simulation test of a series of typical functions, the result indicated that the new algorithm can improve the convergence speed and the ability of jumping out the local optimum solution greatly.

Published in:

E -Business and E -Government (ICEE), 2011 International Conference on

Date of Conference:

6-8 May 2011