By Topic

The implementation of genetic algorithm based on optimizing search space partition

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)
Zhao Lijiang ; Department of Basic education, Guangzhou Sports Training and technical College, China

The bottlenecks which restrict genetic algorithm are premature convergence and easy to fall into local, and the reasons of premature convergence mainly include population size, genetic manipulation, initial population distribution and other factors. Therefore, the optimizing search space algorithm by using taboo domain and effective domain partition can effectively reduce the search space and avoid premature algorithm. This paper studies and discusses the code, operator design and the selection and realization of control parameters of the implementation of stable genetic algorithm of elitist genetic sense units through optimizing search space partition, and the experiments show that the global search and local search ability of algorithm are greatly improved compared with other genetic algorithms, and the average convergence velocity and efficiency of the convergence to the optimum solution is superior to other genetic algorithms.

Published in:

Environmental Science and Information Application Technology (ESIAT), 2010 International Conference on  (Volume:3 )

Date of Conference:

17-18 July 2010