About: Cellular evolutionary algorithm     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatEvolutionaryAlgorithms, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FCellular_evolutionary_algorithm&invfp=IFP_OFF&sas=SAME_AS_OFF

A cellular evolutionary algorithm (cEA) is a kind of evolutionary algorithm (EA) in which individuals cannot mate arbitrarily, but every one interacts with its closer neighbors on which a basic EA is applied (selection, variation, replacement).

AttributesValues
rdf:type
rdfs:label
  • Cellular evolutionary algorithm (en)
rdfs:comment
  • A cellular evolutionary algorithm (cEA) is a kind of evolutionary algorithm (EA) in which individuals cannot mate arbitrarily, but every one interacts with its closer neighbors on which a basic EA is applied (selection, variation, replacement). (en)
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/CEA_neighborhood_types.png
  • http://commons.wikimedia.org/wiki/Special:FilePath/Evolution_of_several_cEAs.png
  • http://commons.wikimedia.org/wiki/Special:FilePath/Ratio_concept_in_cEAs.png
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
thumbnail
has abstract
  • A cellular evolutionary algorithm (cEA) is a kind of evolutionary algorithm (EA) in which individuals cannot mate arbitrarily, but every one interacts with its closer neighbors on which a basic EA is applied (selection, variation, replacement). The cellular model simulates natural evolution from the point of view ofthe individual, which encodes a tentative (optimization, learning, search) problem solution. The essential idea of this model is to provide the EA populationwith a special structure defined as a connected graph, in which each vertex is an individual who communicates with hisnearest neighbors. Particularly, individuals are conceptually set in a toroidalmesh, and are only allowed to recombine with close individuals. This leads usto a kind of locality known as isolation by distance. The set of potential matesof an individual is called its neighborhood. It is known that, in this kindof algorithm, similar individuals tend to cluster creating niches, and these groupsoperate as if they were separate sub-populations (islands). Anyway, there is noclear borderline between adjacent groups, and close niches could be easilycolonized by competitive niches and maybe merge solution contents during the process. Simultaneously,farther niches can be affected more slowly. (en)
gold:hypernym
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 59 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software