DeepAI AI Chat
Log In Sign Up

Evolutionary Optimization in an Algorithmic Setting

by   Mark Burgin, et al.

Evolutionary processes proved very useful for solving optimization problems. In this work, we build a formalization of the notion of cooperation and competition of multiple systems working toward a common optimization goal of the population using evolutionary computation techniques. It is justified that evolutionary algorithms are more expressive than conventional recursive algorithms. Three subclasses of evolutionary algorithms are proposed here: bounded finite, unbounded finite and infinite types. Some results on completeness, optimality and search decidability for the above classes are presented. A natural extension of Evolutionary Turing Machine model developed in this paper allows one to mathematically represent and study properties of cooperation and competition in a population of optimized species.


Convergence Properties of Two (μ + λ) Evolutionary Algorithms On OneMax and Royal Roads Test Functions

We present a number of bounds on convergence time for two elitist popula...

Group theory, group actions, evolutionary algorithms, and global optimization

In this paper we use group, action and orbit to understand how evolution...

Beyond Evolutionary Algorithms for Search-based Software Engineering

Context: Evolutionary algorithms typically require a large number of eva...

Multiple simultaneous solution representations in a population based evolutionary algorithm

The representation used for solutions in optimization can have a signifi...

Cloud-based Evolutionary Algorithms: An algorithmic study

After a proof of concept using Dropbox(tm), a free storage and synchroni...

Evolutionary Turing in the Context of Evolutionary Machines

One of the roots of evolutionary computation was the idea of Turing abou...

SOM-Guided Evolutionary Search for Solving MinMax Multiple-TSP

Multiple-TSP, also abbreviated in the literature as mTSP, is an extensio...