By Topic

An Improved Genetic Algorithm for Solving Conic Fitting Problems

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)
Song Gao ; Comput. Sci. & Technol. Dep., Tsinghua Univ., Beijing, China ; Chunping Li

This paper presents an improved genetic algorithm for solving conic fitting problem. We first use several parallel small-populations genetic algorithms to obtain initial population, which has better average fitness. The range of mutation operator is also set to be gradually reduced with the growing of generation to guarantee the proportion of outstanding individuals within the population. An experiment shows that our improvements on genetic algorithm can remarkably increase the average fitness of population during evolution and enhance the performance of the algorithm as a whole.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:4 )

Date of Conference:

March 31 2009-April 2 2009