Evolutionary computation: a unified approach

By Kenneth A. De Jong. 2018

570 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

A Survey on Neural Architecture Search (2019, background): “Evolutionary algorithms (EA) are population-based global optimizer for black-box functions which consist of following essential components: initialization, parent selection, recombination and mutation, survivor selection (Jong, 2006).”
The Surprising Creativity of Digital Evolution: A Collection of Anecdotes from the Evolutionary Computation and Artificial Life Research Communities (2018, background): “Thus, evolution can be instantiated digitally [18, 19], as a computer program, either to study evolution experimentally or to solve engineering challenges through directed digital breeding.”
Evolutionary Generative Adversarial Networks (2018, background): “Over the last twenty years, evolutionary algorithms have achieved considerable success across a wide range of computational tasks including modeling, optimization and design [51]– [55].”
Identifying Necessary Conditions for Open-Ended Evolution through the Artificial Life World of Chromaria (2014, background): “Inter-estingly, in evolutionary computation, with a few exceptions (Lehman and Stanley, 2010), most EAs implement no such MC: usually all individuals have at least some small probability of reproduction (De Jong, 2006).”
A Tutorial On the design, experimentation and application of metaheuristic algorithms to real-World optimization problems (2021, methodology): “The main representative techniques within these streams are the genetic algorithm (GA, [21, 22]), particle swarm optimization (PSO, [23]), and ant colony optimization (ACO, [24]).”
Minimal criterion coevolution: a new approach to open-ended search (2017, background): “…focused on the idea of selecting individuals for reproduction based on an objective performance scale and iteratively converging on a solution [2]. less common notion of imposing a lower bound on individual performance was introduced early on by Mattiussi and Floreano [15] and later…”