Tuesday, March 23, 2021

[DMANET] Workshop on Evolutionary Computation for the Automated Design of Algorithms


11th Workshop on Evolutionary Computation for the Automated Design of
Algorithms (ECADA) under the auspices of the 23rd ACM Annual Conference on
Genetic and Evolutionary Computation (GECCO 2021) July 10-14, 2021

Note that GECCO 2021 will be an electronic-only conference due to COVID-19
and presentations of all accepted papers will need to be provided in the
form of a pre-recorded talk with live Q&A.

Submission deadline: April 12, 2021


NEW! Confirmed Invited Speaker: Gisele L. Pappa, Associate Professor in the
Computer Science Department at UFMG, Brazil
NEW! Confirmed Programme Committee (see website for details)





We welcome original submissions on all aspects of Evolutionary Computation
for the Automated Design of Algorithms, in particular, evolutionary
computation methods and other hyper-heuristics for the automated design,
generation or improvement of algorithms that can be applied to any instance
of a target problem domain. Relevant methods include methods that evolve
whole algorithms given some initial components as well as methods that take
an existing algorithm and improve it or adapt it to a specific domain.
Another important aspect in automated algorithm design is the definition of
the primitives that constitute the search space of hyper-heuristics. These
primitives should capture the knowledge of human experts about useful
algorithmic components (such as selection, mutation and recombination
operators, local searches, etc.) and, at the same time, allow the
generation of new algorithm variants. Examples of the application of
hyper-heuristics, including genetic programming and automatic configuration
methods, to such frameworks of algorithmic components are of interest to
this workshop, as well as the (possibly automatic) design of the
algorithmic components themselves and the overall architecture of
metaheuristics. Therefore, relevant topics include (but are not limited to):

- Applications of hyper-heuristics, including general-purpose automatic
algorithm configuration methods, for the design of evolutionary algorithms, other metaheuristics and other algorithms for application domains such as optimization, data mining, machine learning, image processing, engineering, cyber security, critical infrastructure protection, and bioinformatics.

- Novel hyper-heuristics, including but not limited to genetic programming
based approaches, automatic configuration methods, and online, offline and life-long hyper-heuristics, with the stated goal of designing or improving the design of algorithms.

- Empirical comparison of hyper-heuristics.

- Theoretical analyses of hyper-heuristics.

- Studies on primitives (algorithmic components) that may be used by
hyper-heuristics as the search space when automatically designing

- Automatic selection/creation of algorithm primitives as a preprocessing
step for the use of hyper-heuristics.

- Analysis of the trade-off between generality and effectiveness of
different hyper-heuristics or of algorithms produced by a hyper-heuristic.

- Analysis of the most effective representations for hyper-heuristics
(e.g., Koza style Genetic Programming versus Cartesian Genetic Programming).

- Asynchronous parallel evolution of hyper-heuristics.

For more detailed information, see the ECADA@GECCO 2021 workshop website (




- Submission deadline: April 12, 2021

- Notification of acceptance: April 26, 2021

- Camera-ready deadline: May 3, 2021

- Author registration deadline: May 3, 2021

- Workshop: half-a-day during GECCO 2021 which runs July 10-14, 2021




Workshop papers must be submitted using the GECCO submission system (
https://ssl.linklings.net/conferences/gecco/). After login, the authors
need to select the "Workshop Paper" submission form. In the form, the
authors must select the workshop they are submitting to. To see a sample of
the "Workshop Paper" submission form, go to GECCO's submission system and
select "Sample Submission Forms". Submitted papers must not exceed 8 pages
(excluding references) and are required to be in compliance with the GECCO
2021 Papers Submission Instructions (
It is recommended to use the same templates as the papers submitted to the
main tracks. Each paper submitted to this workshop will be rigorously
reviewed in a double-blind review process. In other words, authors should
not know who the reviewers of their work are and reviewers should not know
who the authors are. To this end, the following information is very
important: Submitted papers should be ANONYMIZED. This means that they
should NOT contain any element that may reveal the identity of their
authors. This includes author names, affiliations, and acknowledgments.
Moreover, any references to any of the author's own work should be made as
if the work belonged to someone else. All accepted papers will be presented
at the ECADA workshop and appear in the GECCO 2021 Conference Companion
Proceedings. By submitting a paper, the author(s) agree that, if their
paper is accepted, they will:

- Submit a final, revised, camera-ready version to the publisher on or
before the camera-ready deadline.

- Register at least one author by May 3, 2021 to participate in the

- Provide a pre-recorded version of the talk and be present during its
online transmission (which will occur during the days of the conference) to answer questions from the (online) audience.


WORKSHOP CHAIRS (in alphabetical order)


Manuel Lopez-Ibanez (manuel.lopez-ibanez@uma.es)

Daniel R. Tauritz (dtauritz@acm.org)

John R. Woodward (j.woodward@qmul.ac.uk)

For more detailed information, see the ECADA@GECCO 2021 workshop website (

JOHN WOODWARD is inviting you to a scheduled Zoom meeting.
Meeting ID: 946 005 0001 Passcode: U9Ded7

* Contributions to be spread via DMANET are submitted to
* DMANET@zpr.uni-koeln.de
* 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.
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/