By Topic

Adaptive probabilities of crossover and mutation in 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

2 Author(s)
M. Srinivas ; Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore, India ; L. M. Patnaik

In this paper we describe an efficient approach for multimodal function optimization using genetic algorithms (GAs). We recommend the use of adaptive probabilities of crossover and mutation to realize the twin goals of maintaining diversity in the population and sustaining the, convergence capacity of the GA. In the adaptive genetic algorithm (AGA), the probabilities of crossover and mutation, pc and p m, are varied depending on the fitness values of the solutions. High-fitness solutions are `protected', while solutions with subaverage fitnesses are totally disrupted. By using adaptively varying pc and p, we also provide a solution to the problem of deciding the optimal values of pc and pm, i.e., pc and pm need not be specified at all. The AGA is compared with previous approaches for adapting operator probabilities in genetic algorithms. The Schema theorem is derived for the AGA, and the working of the AGA is analyzed. We compare the performance of the AGA with that of the standard GA (SGA) in optimizing several nontrivial multimodal functions with varying degrees of complexity

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:24 ,  Issue: 4 )