By Topic

A new crossover operator based on the rough set theory for genetic algorithms

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

4 Author(s)
Fan Li ; Coll. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol. of China, China ; Qi-He Liu ; Fan Min ; Guo-Wei Yang

The performance of genetic algorithms (GAs) is dependent on many factors. In this paper, we have isolated one factor: the crossover operator. Commonly used crossover operators such as one-point, two-point and uniform crossover operator are likely to destroy the information obtained previously because of their random choices of crossover points. To overcome this defect, RSO, a new adaptive crossover operator based on the rough set theory, is proposed. By using RSO, useful schemata can be found and have a higher probability of surviving recombination regardless of their defining length. In this paper, the mechanism of RSO is discussed and its performance is compared with two-point crossover operator on several typical function optimization problems. The experimental results show that the proposed operator is more efficient.

Published in:

2005 International Conference on Machine Learning and Cybernetics  (Volume:5 )

Date of Conference:

18-21 Aug. 2005