On identifying global optima in cooperative coevolution

When applied to optimization problems, Cooperative Coevolutionary Algorithms (CCEA) have been observed to exhibit a behavior called relative overgeneralization. Roughly, they tend to identify local optima with large basins of attraction which may or may not correspond to global optima. A question which arises is whether one can modify the algorithm to promote the discovery of global optima. We argue that a mechanism from Pareto coevolution can achieve this end. We observe that in CCEAs candidate individuals from one population are used as tests or measurements of individuals in other populations; by treating individuals as tests in this way, a finer-grained comparison can be made among candidate individuals. This finer-grained view permits an algorithm to see when two candidates are differently capable, even when one’s evident value is higher than the other’s. By modifying an existing CCEA to compare individuals using Pareto dominance we have produced an algorithm which reliabl...

• Type: Conference
• Year: 2005
• Where: GECCO
• Authors: Anthony Bucci, Jordan B. Pollack
• Keywords: Algorithm, Candidate Individuals, GECCO 2005, Global Optima