This HTML5 document contains 39 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n7https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Constructive_cooperative_coevolution
rdf:type
dbo:Software
rdfs:label
Constructive cooperative coevolution
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.
dcterms:subject
dbc:Evolutionary_algorithms dbc:Evolutionary_computation
dbo:wikiPageID
44636079
dbo:wikiPageRevisionID
1070217133
dbo:wikiPageWikiLink
dbr:Deterministic dbr:Stochastic_optimization dbr:Global_optimisation dbr:Evolutionary_algorithm dbr:Metaheuristic dbr:Hyper-heuristics dbr:Global_optimization dbr:Particle_swarm_optimization dbc:Evolutionary_algorithms dbr:Stochastic_search dbr:Differential_evolution dbr:Round-robin_scheduling dbr:Genetic_algorithms dbr:Swarm_intelligence dbr:Greedy_randomized_adaptive_search_procedure dbr:Cooperative_coevolution dbr:Multi-objective_optimization dbr:Stochastic dbc:Evolutionary_computation dbr:Artificial_intelligence
owl:sameAs
n7:2MYny wikidata:Q25048666 yago-res:Constructive_cooperative_coevolution freebase:m.012npl1w
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Short_description dbt:Not_a_typo
dbo: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.
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
wikipedia-en:Constructive_cooperative_coevolution?oldid=1070217133&ns=0
dbo:wikiPageLength
10719
foaf:isPrimaryTopicOf
wikipedia-en:Constructive_cooperative_coevolution