Title
Coevolutionary Principles
Abstract
Coevolutionary algorithms approach problems for which no function for evaluating potential solutions is present or known. Instead, algorithms rely on the aggregation of outcomes from interactions among evolving entities in order to make selection decisions. Given the lack of an explicit yardstick, understanding the dynamics of coevolutionary algorithms, judging whether a given algorithm is progressing, and designing effective new algorithms present unique challenges unlike those faced by optimization or evolutionary algorithms. The purpose of this chapter is to provide a foundational understanding of coevolutionary algorithms and to highlight critical theoretical and empirical work done over the last two decades. This chapter outlines the ends and means of coevolutionary algorithms: what they are meant to find, and how they should find it.
Publication Date
1-1-2012
Publication Title
Handbook of Natural Computing
Volume
2-4
Number of Pages
987-1033
Document Type
Article; Book Chapter
Personal Identifier
scopus
DOI Link
https://doi.org/10.1007/978-3-540-92910-9_31
Copyright Status
Unknown
Socpus ID
84924709178 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/84924709178
STARS Citation
Popovici, Elena; Bucci, Anthony; Wiegand, R. Paul; and de Jong, Edwin D., "Coevolutionary Principles" (2012). Scopus Export 2010-2014. 5632.
https://stars.library.ucf.edu/scopus2010/5632