Parallel Problem Solving From Nature, PPSN XI 2010
DOI: 10.1007/978-3-642-15844-5_45
|View full text |Cite
|
Sign up to set email alerts
|

A Memetic Cooperative Optimization Schema and Its Application to the Tool Switching Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 16 publications
0
3
0
Order By: Relevance
“…Only the results from the cooperative SDI technique seemed promising, but they were still inferior to the MA plus HC proposed by Amaya, Cotta, and Fernández (2008). At about the same time, Amaya, Cotta, and Leiva (2010a) and Amaya, Cotta, and Fernández-Leiva (2011) extend the above mentioned cooperative scheme and combine the features of memetic agent models supported by different LS mechanisms, namely HC and TS. The results show that especially heterogeneous memetic agents that exchange current best solutions outperform individual agents.…”
Section: The Uniform Sspmentioning
confidence: 95%
“…Only the results from the cooperative SDI technique seemed promising, but they were still inferior to the MA plus HC proposed by Amaya, Cotta, and Fernández (2008). At about the same time, Amaya, Cotta, and Leiva (2010a) and Amaya, Cotta, and Fernández-Leiva (2011) extend the above mentioned cooperative scheme and combine the features of memetic agent models supported by different LS mechanisms, namely HC and TS. The results show that especially heterogeneous memetic agents that exchange current best solutions outperform individual agents.…”
Section: The Uniform Sspmentioning
confidence: 95%
“…Cooperative co-evolution is increasingly becoming the basis of successful applications [1,6,8,15,19], including learning problems, see for instance [3]. These approaches can be shared into two main categories: co-evolution process that happens between a fixed number of separate populations [5,13,14] or within a single population [7,10,18].…”
Section: Introductionmentioning
confidence: 99%
“…Cooperative co-evolution is increasingly becoming the basis of successful applications [2,8,11,22,28], including learning [5] and scheduling problems [15]. These approaches can be shared into two main categories: heterogeneous co-evolution that happens between a fixed number of separate populations [7,20,21], and homogeneous co-evolution, that occurs within a single population [17,27,29].…”
Section: Introductionmentioning
confidence: 99%