Self-adaptive population size adjustment for genetic algorithms

Research output: Chapter in Book/Report/Conference proceedingsConference contributionpeer-review

24 Citations (Scopus)

Abstract

Variable population sizing techniques are rarely considered in the theory of Genetic Algorithms. This paper discusses a new variant of adaptive population sizing for this class of Evolutionary Algorithms. The basic idea is to adapt the actual population size depending on the actual ease or difficulty of the algorithm in its ultimate goal to generate new child chromosomes that outperform their parents.

Original languageEnglish
Title of host publicationComputer Aided Systems Theory - EUROCAST 2007 - 11th International Conference on Computer Aided Systems Theory, Revised Selected Papers
PublisherSpringer Verlag
Pages820-828
Number of pages9
Volume4739
Edition4739
ISBN (Print)9783540758662
DOIs
Publication statusPublished - 2007
Event11th International Conference on Computer Aided Systems Theory, EUROCAST 2007 - Las Palmas de Gran Canaria, Spain
Duration: 12 Feb 200716 Feb 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4739 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Conference on Computer Aided Systems Theory, EUROCAST 2007
CountrySpain
CityLas Palmas de Gran Canaria
Period12.02.200716.02.2007

Fingerprint Dive into the research topics of 'Self-adaptive population size adjustment for genetic algorithms'. Together they form a unique fingerprint.

Cite this