By Topic

Accelerating genetic algorithms: protected chromosomes and parallel processing

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 $33
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)
N. Adachi ; Fujitsu Labs. Ltd., Japan ; Y. Yoshida

This paper proposes a new method for speeding up genetic algorithms (GAs) by temporarily protecting some components of chromosomes from ordinary genetic operators such as crossover and mutation. Protecting some components of chromosomes can reduce the search space, speeding up GAs that use this method. This new method is implemented on a subpopulation-type parallelised genetic algorithm. Each subpopulation protects some promising components of its chromosomes, and improves those components in cooperation with or competition against other subpopulations. Common components of chromesomes in a subpopulation are chosen as a protected part in that subpopulation, for convenience. Several travelling salesman problems are used to illustrate the accelerating effect of this method. The simulation results show that a GA using this method is able to search about twice as fast as a non-protecting parallelised GA

Published in:

Genetic Algorithms in Engineering Systems: Innovations and Applications, 1995. GALESIA. First International Conference on (Conf. Publ. No. 414)

Date of Conference:

12-14 Sep 1995