By Topic

A Fast Hybrid Genetic Algorithm in Heterogeneous Computing Environment

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

2 Author(s)
Zhijiang Jiang ; Shenzhen Inst. of Adv. Technol., Chinese Acad. of Sci., Shenzhen, China ; Shengzhong Feng

A hybrid genetic algorithm (HGA) is proposed for heterogeneous computing environment scheduling in this paper. Individual and population adaptability are introduced for making the crossover and mutation probability adjusted adaptively, making the number of crossover and mutation adjust adaptively with the proportion of average and maximum fitness. It can avoid such the disadvantages as premature convergence, low convergence speed. Also, a new acceptance criterion based on the simulated annealing heuristics is proposed for improving the local convergence. Compared with the traditional local search, the new criterion introduced random factors through Metropolis criterion, bad solutions can be accepted. An experimental result demonstrates that the proposed genetic algorithm does not get stuck at a local optimization easily, and it is fast in convergence.

Published in:

Natural Computation, 2009. ICNC '09. Fifth International Conference on  (Volume:4 )

Date of Conference:

14-16 Aug. 2009