By Topic

Enhancing the efficiency of genetic algorithm by identifying linkage groups using DSM clustering

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)
Amin Nikanjam ; Computer Engineering Department, Iran University of Science and Technology, Narmak, Teharn, Iran ; Hadi Sharifi ; B. Hoda Helmi ; Adel Rahmani

Standard genetic algorithms are not very suited to problems with multivariate interactions among variables. This problem has been identified from the beginning of these algorithms and has been termed as the linkage learning problem. Numerous attempts have been carried out to solve this problem with various degree of success. In this paper, we employ an effective algorithm to cluster a dependency structure matrix (DSM) which can correctly identify the linkage groups. Once all the linkage groups are identified, a simple genetic algorithm using BB-wise crossover can easily solve hard optimization problems. Experimental results with a number of deceptive functions with various sizes presented to show the efficiency enhancement obtained by the proposed method. The results are also compared with Bayesian Optimization Algorithm, a well-known evolutionary optimizer, to demonstrate this improvement.

Published in:

IEEE Congress on Evolutionary Computation

Date of Conference:

18-23 July 2010