By Topic

An improved gradient-based niching genetic 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

2 Author(s)
Jia Yuge ; Sch. of Resource & Earth Sci., China Univ. of Min. & Technol., Xuzhou, China ; Nie Ru

A new gradient-based niching genetic algorithm is proposed in this paper to solve the problems of premature convergence and slower searching ability near a point in conventional genetic algorithm. The best point of genetic algorithm is selected as the start point of gradient to improve the ability of finding the local best and restricted competition selection niche algorithm is used to ensure the population diversity. At last the proposed method is applied to estimate the parameters of nonlinear system. Results show that the proposed algorithm can not only improve the ability of finding the local best but also solves the problems of premature convergence.

Published in:

Computer Science and Automation Engineering (CSAE), 2011 IEEE International Conference on  (Volume:1 )

Date of Conference:

10-12 June 2011