Compared with conventional algorithms, evolutionary algorithms(EAs) are usually more efficient for system design because they canprovide more opportunity for obtaining the global optimal solution.However, the EAs cannot be used directly to design large-scale systemsbecause a large amount of computations are required. To solve thisproblem, many approaches have been proposed in the literature.Cooperative co-evolutionary algorithms (CCEA) are possibly one of themost efficient approaches. The basic idea of most CCEAs isdivide-and-conquer: divide the system into many modules, define anindividual as a candidate of a module, assign a population to eachmodule, find good individuals within each population, and put themtogether again to form the whole system. The author generalizes earlierstudies, and introduces a society model for the study of CCEAs. Based onthe society model, the author formulates existing CCEAs in a generalframework. The author also provides several case studies, all of whichare interesting topics, for future research
展开▼
