Sunday, May 2, 2021

[DMANET] CFP: Special Issue on Theoretical Foundations of Evolutionary Computation

We invite submissions of papers on the theory of evolutionary
computation for publication in a special issue of Theoretical Computer
Science, Track C -Theory of Natural Computing.

Guest Editors

Per Kristian Lehre, University of Birmingham, U.K.
Aneta Neumann, The University of Adelaide, Australia
Chao Qian, Nanjing University, China


Evolutionary computation methods such as evolutionary algorithms and
swarm intelligence algorithms have been successfully applied to a wide
range of real-world optimization problems. Conventional optimization
algorithms often require objective functions to be differentiable,
continuous, or convex. However, these assumptions are often not met in
real-world optimization. In contrast, evolutionary computation methods
only assume (zeroth order) black-box access to the objective values of

Mimicking natural phenomena, evolutionary computation methods are often
highly randomized and complex, making a theoretical analysis
challenging. During the past two decades, there have been significant
theoretical efforts. This research has brought general theoretical
analysis tools such as fitness levels and drift analysis. These results
provide useful insights into the working principles of evolutionary
computation methods which have helped practitioners design more powerful
algorithms. As evolutionary computation methods are applied to more
complex real-world optimization problems, there is a need to further
understand these methods theoretically. Thus, this special issue aims to
advance the theoretical understanding of evolutionary computation


This special issue solicits original, high-quality contributions on the
theory of evolutionary computation. The scope includes, but is not
limited to:

General analytical methods like fitness levels and drift analysis
Exact and approximation runtime analysis
Black-box complexity
Population diversity and dynamics
Variation and selection operators
Fitness landscape and problem difficulty analysis

All classes of evolutionary computation methods will be considered
including (but not limited to): evolutionary algorithms, ant colony
optimization, artificial immune systems, particle swarm optimization,
estimation of distribution algorithms and differential evolution. All
problem domains will be considered, including (but not limited to):
discrete and continuous optimization, single-objective and
multi-objective optimization, constrained optimization, and optimization
under uncertainty (e.g., noisy, dynamic and robust optimization).

Planned Schedule

Submission deadline: December 31, 2021
Notification: September 31, 2022
Final paper submission: October 31, 2022
Tentative publication date: 2023

Submission Instructions

Authors should submit their manuscripts to the Theoretical Computer
Science Editorial System (EM) at, and indicate "Special
Issue: Theoretical Foundations of Evolutionary Computation" for their

Contributions should be typeset in PDF format or the system converts
article files to a single PDF file used in the peer-review
process. Editable files (e.g., Word, LaTeX) are required to typeset an
article for final publication, and must comply with TCS's author
guidelines, which can be retrieved from the Elsevier website,
* Contributions to be spread via DMANET are submitted to
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.