Population partitioning in genetic algorithms

B Kemp; S J Porter; J F Dawson

Population partitioning in genetic algorithms

Engineering

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	1928-1929
Number of pages	2
Journal	Electronics Letters
Volume	34
Issue number	20
Publication status	Published - 1 Oct 1998

Cite this

@article{ea1318577bfb4258b73746460c46a263,

title = "Population partitioning in genetic algorithms",

abstract = "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.",

author = "B Kemp and Porter, {S J} and Dawson, {J F}",

year = "1998",

month = oct,

day = "1",

language = "English",

volume = "34",

pages = "1928--1929",

journal = "Electronics Letters",

issn = "0013-5194",

publisher = "John Wiley & Sons Inc.",

number = "20",

}

TY - JOUR

T1 - Population partitioning in genetic algorithms

AU - Kemp, B

AU - Porter, S J

AU - Dawson, J F

PY - 1998/10/1

Y1 - 1998/10/1

N2 - 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.

AB - 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.

M3 - Article

SN - 0013-5194

VL - 34

SP - 1928

EP - 1929

JO - Electronics Letters

JF - Electronics Letters

IS - 20

ER -