By Topic

Modal mutations in evolutionary 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
$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)
Voigt, H.-M. ; Bionics & Evolution Techniques Lab., Tech. Univ. Berlin, Germany ; Anheyer, T.

With this paper modal mutation schemes for evolutionary algorithms as a generalization of the breeder genetic algorithm mutation scheme are introduced and analyzed for multimodal continuous parameter optimization problems. A new scaling rule for multiple mutations is formalized and compared with a new step-size scaling for evolution strategies. A performance comparison of the multivalued evolutionary algorithm with modal mutations with recently published results concerning the performance of Bayesian/sampling and very fast simulated reannealing techniques for global optimization is given

Published in:

Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on

Date of Conference:

27-29 Jun 1994