About: Constructive cooperative coevolution

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Constructive cooperative coevolution Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Software, 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%2FConstructive_cooperative_coevolution&invfp=IFP_OFF&sas=SAME_AS_OFF

The constructive cooperative coevolutionary algorithm (also called C3) is a global optimisation algorithm in artificial intelligence based on the multi-start architecture of the greedy randomized adaptive search procedure (GRASP). It incorporates the existing cooperative coevolutionary algorithm (CC). The considered problem is decomposed into subproblems. These subproblems are optimised separately while exchanging information in order to solve the complete problem. An optimisation algorithm, usually but not necessarily an evolutionary algorithm, is embedded in C3 for optimising those subproblems. The nature of the embedded optimisation algorithm determines whether C3's behaviour is deterministic or stochastic.

Attributes	Values
rdf:type	software
rdfs:label	Constructive cooperative coevolution (en)
rdfs:comment	The constructive cooperative coevolutionary algorithm (also called C3) is a global optimisation algorithm in artificial intelligence based on the multi-start architecture of the greedy randomized adaptive search procedure (GRASP). It incorporates the existing cooperative coevolutionary algorithm (CC). The considered problem is decomposed into subproblems. These subproblems are optimised separately while exchanging information in order to solve the complete problem. An optimisation algorithm, usually but not necessarily an evolutionary algorithm, is embedded in C3 for optimising those subproblems. The nature of the embedded optimisation algorithm determines whether C3's behaviour is deterministic or stochastic. (en)
dcterms:subject	Evolutionary computation Evolutionary algorithms
Wikipage page ID	44636079 (xsd:integer)
Wikipage revision ID	1070217133 (xsd:integer)
Link from a Wikipage to another Wikipage	Metaheuristic Deterministic Cooperative coevolution Stochastic Evolutionary computation Particle swarm optimization Differential evolution Global optimization Round-robin scheduling Artificial intelligence Evolutionary algorithms Greedy randomized adaptive search procedure Genetic algorithms Swarm intelligence Evolutionary algorithm Multi-objective optimization Stochastic optimization Stochastic search Hyper-heuristics Global optimisation
sameAs	Constructive cooperative coevolution Constructive cooperative coevolution Constructive cooperative coevolution Constructive cooperative coevolution
dbp:wikiPageUsesTemplate	dbt:Not_a_typo dbt:Reflist dbt:Short_description
has abstract	The constructive cooperative coevolutionary algorithm (also called C3) is a global optimisation algorithm in artificial intelligence based on the multi-start architecture of the greedy randomized adaptive search procedure (GRASP). It incorporates the existing cooperative coevolutionary algorithm (CC). The considered problem is decomposed into subproblems. These subproblems are optimised separately while exchanging information in order to solve the complete problem. An optimisation algorithm, usually but not necessarily an evolutionary algorithm, is embedded in C3 for optimising those subproblems. The nature of the embedded optimisation algorithm determines whether C3's behaviour is deterministic or stochastic. The C3 optimisation algorithm was originally designed for simulation-based optimisation but it can be used for global optimisation problems in general. Its strength over other optimisation algorithms, specifically cooperative coevolution, is that it is better able to handle non-separable optimisation problems. An improved version was proposed later, called the Improved Constructive Cooperative Coevolutionary Differential Evolution (C3iDE), which removes several limitations with the previous version. A novel element of C3iDE is the advanced initialisation of the subpopulations. C3iDE initially optimises the subpopulations in a partially co-adaptive fashion. During the initial optimisation of a subpopulation, only a subset of the other subcomponents is considered for the co-adaptation. This subset increases stepwise until all subcomponents are considered. This makes C3iDE very effective on large-scale global optimisation problems (up to 1000 dimensions) compared to cooperative coevolutionary algorithm (CC) and Differential evolution. The improved algorithm has then been adapted for multi-objective optimization. (en)
gold:hypernym	Algorithm
prov:wasDerivedFrom	wikipedia-en:Constructive_cooperative_coevolution?oldid=1070217133&ns=0
page length (characters) of wiki page	10719 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Constructive_cooperative_coevolution
is Link from a Wikipage to another Wikipage of	Cooperative coevolution Greedy randomized adaptive search procedure Outline of machine learning
is foaf:primaryTopic of	wikipedia-en:Constructive_cooperative_coevolution

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software