By Topic

Population partitioning 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 $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

3 Author(s)
B. Kemp ; Dept. of Electron., York Univ., UK ; S. J. Porter ; J. F. Dawson

When an optimisation landscape is highly multimodal, even a genetic algorithm can become stuck in local minima. Increasing the population size is one way to ensure that the search space is more comprehensively sampled. But it can be a more efficient use of population members to allow a number of subpopulations to evolve separately and then interbreed with one another. One example of such a multimodal problem is scattering from a conductive object, which is important in applications such as radar cross-section optimisation

Published in:

Electronics Letters  (Volume:34 ,  Issue: 20 )