By Topic

Parallel adaptive hybrid genetic optimization algorithm and its application

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

5 Author(s)
Aimin An ; Inst. of Electr. Eng. & Inf. Eng., Lanzhou Univ. of Technol., Lanzhou, China ; Xiaohong Hao ; Guici Yuan ; Chao Zhao
more authors

A pragmatic hybrid genetic algorithm named parallel adaptive genetic simulated annealing (PAGSA) is developed. The proposed hybrid approach combines the merits of genetic algorithm (GA) with simulated annealing (SA) to construct a more efficient genetic simulated annealing (GSA) algorithm for global search, while the iterative hill climbing (IHC) method is used as a local search technique to incorporate into GSA loop for speeding up the convergence of the algorithm. In addition, a self-adaptive hybrid mechanism is developed to maintain a tradeoff between the global and local optimizer searching then to efficiently locate quality solution to complicated optimization problem. The computational results and application have illustrated that the global searching ability and the convergence speed of this hybrid algorithm are significantly improved.

Published in:

Computational Intelligence and Industrial Applications, 2009. PACIIA 2009. Asia-Pacific Conference on  (Volume:1 )

Date of Conference:

28-29 Nov. 2009