Ubiquity symposium: Evolutionary computation and the processes of life: the essence of evolutionary computation

In this third article in the ACM Ubiquity symposium on evolutionary computation Xin Yao provides a deeper understanding of evolutionary algorithms in the context of classical computational paradigms. This article discusses some of the most important issues in evolutionary computation. Three major areas are identified. The first is the theoretical foundation of evolutionary computation, especially the computational time complexity analysis. The second is on algorithm design, especially on hybridization, memetic algorithms, algorithm portfolios and ensembles of algorithms. The third is co-evolution, which seems to be under studied in both theory and practice. The primary aim of this article is to stimulate further discussions, rather than to offer any solutions.

[1]  Peter Tiño,et al.  Measuring Generalization Performance in Coevolutionary Learning , 2008, IEEE Transactions on Evolutionary Computation.

[2]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[3]  Xin Yao,et al.  From an individual to a population: an analysis of the first hitting time of population-based evolutionary algorithms , 2002, IEEE Trans. Evol. Comput..

[4]  Xin Yao,et al.  Maximum Cardinality Matching by Evolutionary Algorithms , 2002 .

[5]  Mehmet Fatih Tasgetiren,et al.  An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem , 2010, Appl. Math. Comput..

[6]  Xin Yao,et al.  Large scale evolutionary optimization using cooperative coevolution , 2008, Inf. Sci..

[7]  William E. Hart,et al.  Recent Advances in Memetic Algorithms , 2008 .

[8]  Xin Yao,et al.  Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..

[9]  Xiaodong Li,et al.  Cooperatively Coevolving Particle Swarms for Large Scale Optimization , 2012, IEEE Transactions on Evolutionary Computation.

[10]  Frank Neumann,et al.  Bioinspired computation in combinatorial optimization: algorithms and their computational complexity , 2012, GECCO '12.

[11]  Per Kristian Lehre,et al.  On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms , 2012, IEEE Trans. Evol. Comput..

[12]  Xin Yao,et al.  Multi-network evolutionary systems and automatic decomposition of complex problems , 2006, Int. J. Gen. Syst..

[13]  Fei Peng,et al.  Population-Based Algorithm Portfolios for Numerical Optimization , 2010, IEEE Transactions on Evolutionary Computation.

[14]  Xin Yao,et al.  A Large Population Size Can Be Unhelpful in Evolutionary Algorithms a Large Population Size Can Be Unhelpful in Evolutionary Algorithms , 2022 .

[15]  Per Kristian Lehre,et al.  Crossover Can Be Constructive When Computing Unique Input Output Sequences , 2008, SEAL.