LISTSERV mailing list manager LISTSERV 16.0

Help for EC-DIGEST-L Archives

EC-DIGEST-L Archives

EC-DIGEST-L Archives













By Topic:










By Author:











Proportional Font





EC-DIGEST-L  May 2021

EC-DIGEST-L May 2021


EC-Digest v35n5


Eric 'Siggy' Scott <[log in to unmask]>


Evolutionary Computation Digest <[log in to unmask]>


Thu, 6 May 2021 18:12:21 -0400





text/plain (507 lines)

Evolutionary Computation Digest — Thursday, 06 Mary 2021, Volume
35: Issue 5

SUBMISSION ADDRESS:    [log in to unmask]

(UN)SUBSCRIPTION INSTRUCTIONS:  at the bottom of this email

Today's Topics:

- Request for examples of Successful EA Applications and Achievements
- 20 May: Postdoc opening: "Time-Complexity Analysis of
co-Evolutionary Algorithms"

 CFPs (with submission deadline)
 - 23 May (Extended): Foundations of Genetic Algorithms XVI
 - 30 May: International Conference on Metaheuristics and Nature
Inspired Computing (META'2021)
 - 10 May: International Conference on Natural Computation, Fuzzy
Systems, and Knowledge Discovery (ICN FSKD)
 - June 27 for entries: GECCO Competition on Dynamic Stacking
Optimization in Uncertain Environments
 - 30 June: Applied Sciences special issue on "Application of
Evolutionary Computation"
 - 31 December: Theoretical Computer Science, Track C special issue on
Theory of Natural Computing


July 10–14, 2021, Lille, France (ONLINE-ONLY): GECCO 2021
Sep 06–08, 2021, Dornbirn, Austria (ONLINE-ONLY): FOGA 2021

Sender: Kalyanmoy Deb [log in to unmask]
Subject: Successful EC Applications and Achievements

Hello All,

Wish all of you are staying safe from the recent rise of the pandemic. I
really hope this would really be the last year of working from home and
we can all meet in an international conference soon. That would be a
great celebration for all of us!

I have been requested by Dr. Owen D. Jones, Professor of Law and
Biological Sciences, Director of MacArthur Foundation Research Network
on Law and Neuroscience and Professor at Vanderbilt University to
compile a list of significant work highlighting

"What do we consider to be the most engaging example, for a lay
audience, of the success of Evolutionary Computation?"

for his upcoming book (under contract with WW Norton publishing) that
will highlight for a broad audience some of the many ways, across many
domains, that understanding natural selection can improve human lives,
knowledge, and achievements.

I thought he may be looking for significant EC applications in all
aspects of practice, society and science. Algorithmic breakthroughs can
be listed, provided they were critical in any significant applications
vis-a-vis non-EC methods.

We have a come a long way since the first ICGA conference in 1985 (35
years ago), although many EC pioneers started their EC research much
earlier. It is probably a good time for us as a community to come up
with such a document highlighting significant successful EC applications
and achievements for the scientific community at large.

Please send me a link (or document) of your and any other work that you
know, so I can compile a list and send him. He promised an
acknowledgement of such works in his book.

Depending on the volume of response, we can then collectively prepare a
more detailed document highlighting our significant achievements so far.

Thank you for your efforts! Be safe!

Kalyanmoy Deb
Koenig Endowed Chair Professor
Department of Electrical & Computer Engineering
Professor of Computer Science & Engineering
Professor of Mechanical Engineering
Michigan State University
428 S. Shaw Lane, 2120 EB
East Lansing, MI 48824, USA
Office: 517 432 2144 Beacon: 517 884 2567 Cell: 517 930 0846
Fax: 517 353 1980
Email: [log in to unmask]

Sender: Per Kristian Lehre <[log in to unmask]>
Subject: Postdoc opening: "Time-Complexity Analysis of co-Evolutionary

Dear colleagues,

We welcome applications for a Research Fellow (postdoc) in the theory
of evolutionary computation to work with Dr Per Kristian Lehre on the
UKRI Turing AI Fellowship funded project "Rigorous Time-Complexity
Analysis of co-Evolutionary Algorithms". Co-evolutionary algorithms
are heuristic optimisation techniques, mimicking biological principles
of natural selection, e.g. for minmax/robust optimisation and learning
game playing strategies.

The successful candidate will contribute, together with another 3 year
postdoc, 2 PhD students, and international academic and industrial
partners, towards developing the theoretical foundation necessary for
the design of efficient and reliable co-evolutionary algorithms.

The ideal candidate will have a strong research track record in theory
of evolutionary computation, algorithmic game theory, and/or
randomised algorithms.

For further details, please see

The closing date is 20 May 2021.

Best wishes,
Dr Per Kristian Lehre
Senior Lecturer in School of Computer Science
University of Birmingham, UK
@pklehre on Twitter

Sender: Pietro Oliveto <[log in to unmask]>
Subject: FOGA2021 CFP: Online Conference and Submission Site Open

FOGA2021: Foundations of Genetic Algorithms XVI

The conference is now officially an online-only event and the
submission site is now open

The FOGA conference series aims at advancing the understanding of the
working principles behind Evolutionary Algorithms and related
Randomized Search heuristics. It is a premier event to discuss
advances in the theoretical foundations of these algorithms,
corresponding tools and frameworks suitable to analyze them, and
different aspects of comparing algorithm performance.

Date: September 6-8, 2021
Venue: FH Vorarlberg University of Applied Sciences, Dornbirn, Austria
[changed to an online-only event]

Conference website:

Submission link:
Submission deadline (final)
May 23, 2021

List of Topics

Run time analysis
Mathematical tools suitable for the analysis of search heuristics
Fitness landscapes and problem difficulty
Configuration and selection of algorithms, heuristics, operators, and parameters
Stochastic and dynamic environments, noisy evaluations
Constrained optimization
Problem representation
Complexity theory for search heuristics
Multi-objective optimization
Connections between black-box optimization and machine learning

FOGA 2021 invites submissions covering the entire spectrum of work,
ranging from rigorously derived mathematical results to carefully
designed empirical studies.

Important Dates
Submission deadline (final): May 23, 2021
Author rebuttal phase: June 21 - 27, 2021
Notification of acceptance: June 27, 2021
Camera-ready submission: July 14, 2021
Early-registration deadline: July 14, 2021


The conference will be held at Vorarlberg University of Applied
Sciences in Dornbirn, Austria. Located in the center of Europe,
Dornbirn is one of the major cities of the Alpine Rhine Valley. For
details, refer to the conference website.

The ongoing limitations have led to the decision to make FOGA2021 an
online-only event. Nevertheless, the organization team will do its
best to provide a pleasant and exciting conference experience.

Sender: Eric Medvet <[log in to unmask]>
Subject: CFP META'2021 @Marrakech

Apologies for cross-posting. Appreciate if you can distribute this CFP
to your network.

International Conference on Metaheuristics and Nature Inspired Computing
                            27-30 Oct 2021
                          Marrakech, Morocco

META is one of the main event focusing on the progress of the area of
metaheuristics and their applications. As in previous editions,
META’2021 will provide an opportunity to the international research
community in metaheuristics to discuss recent research results, to
develop new ideas and collaborations, and to meet old friends and make
new ones in a friendly and relaxed atmosphere.

All selected long papers will be published in the Springer (SCOPUS,
ISI, DBLP) conference proceedings.

At least 2 special issues in ISI and SCOPUS journals are also confirmed.

META'2021 welcomes presentations that cover any aspects of
metaheuristic research such as new algorithmic developments,
high-impact applications, new research challenges, theoretical
developments, implementation issues, and in-depth experimental
studies. META'2021 strives for a high-quality program that will be
completed by a number of invited talks, tutorials, workshops and
special sessions.

The scope of the META conference includes, but is not limited to:
    * Local search, tabu search, simulated annealing, VNS, ILS, …
    * Evolutionary algorithms, swarm intelligence, bio-inspired algorithms, …
    * Emergent nature inspired algorithms: quantum computing,
artificial immune systems, bee colony, DNA computing, …
    * Quantum computing
    * Parallel and distributed algorithms
    * Decomposition methods
    * Hybrid methods with machine learning, game theory, mathematical
programming, constraint programming, co-evolutionary, …
    * Application to: logistics and transportation, networks,
scheduling, data mining, engineering design, energy, cloud,
bio-medical, …
    * Theory of metaheuristics, landscape analysis, convergence,
problem difficulty, very large neighbourhoods, …
    * Multi-objective optimization, bi-level optimization
    * Dynamic optimization, problems with uncertainty, stochastic
optimization, …
    * Parameter tuning (static, dynamic, adaptive, self-adaptive)
    * Hyper-heuristics, cross-domain metaheuristics
    * Software frameworks for metaheuristics and nature inspired computing

Important dates

- Submission deadline: May 30, 2021
- Notification of acceptance: June 18, 2021

Sender: ICNC FSKD <[log in to unmask]>
Subject: 17th Conf. Natural Computation, Fuzzy Systems and Knowledge Discovery

24-26 July 2021

UNESCO World Heritage sites in Guizhou include Hailongtun Tusi
Fortress, Fanjingshan, South China Karst at Xiaoqikong, and China
Danxia at Chishui.

Sender: Beham Andreas <[log in to unmask]>
Subject: Competition on Dynamic Stacking Optimization in Uncertain
Environments @ GECCO 2021


to be held as part of the 2021 Genetic and Evolutionary Computation
Conference (GECCO 2021) organized by ACM SIGEVO

Competition webpage:

In this competition we give you a server where you can delve into two
challenging and mysterious worlds of blocks and stacks. The hero in
these worlds are robotic cranes that are fearlessly stacking and
delivering blocks. Did you ever wish to take control of such a robot
solving a herculean task? Well, now is your chance! Our cranes want to
do a good job and therefore rely on YOUR optimization skills! They
wait for you to tell it which blocks to pick up and where to drop them
off so that the continuing stream of incoming blocks is dealt with
most effortlessly.

A 15 minutes getting started tutorial is available on the competition
webpage which shows how you can run a (pretty bad) sample policy. This
is implemented in four different languages: C++, Python, C#, and Rust.
However, you can use any other programming language that you like! The
basic requirements is that you have an implementation of ZeroMQ and
Protobuf. We aimed to make the topic of optimization in dynamic or
uncertain environments as easy to approach as possible and yet create
a challenging and also rewarding experience.

There are two tacks with increasing complexity and challenge. Each
time you have one hour in real-time where you decide on the cranes’
actions. In the first track “Hotstorage” you are controlling one crane
that serves one arrival stack and one handover stack using a range of
buffer stacks. In the second track “Rolling mill” you are controlling
two cranes with capacity > 1 that serve a larger number of arrival
stacks and two handover stacks. You can compete in either or both
tracks. You are given certain training scenarios to test your solver

This competition is hosted by Andreas Beham, Stefan Wagner, Sebastian
Leitner, Johannes Karder, and Bernhard Werth at the University of
Applied Sciences Upper Austria ( Hagenberg Campus
within the research project Josef Ressel Center for Adaptive
Optimization in Dynamic Environments ( led by
Stefan Wagner and funded by the Christian Doppler
Forschungsgesellschaft ( If you have any
questions, comments, or suggestions, please don't hesitate to contact
us at [log in to unmask]

You can also publish a 2-page summary of your contributions in the
Companion Materials of the Proceedings of ACM Genetic and Evolutionary
Computation Conference (GECCO 2021). Deadline for these 2-page
summaries is April 12th. Instructions are given [*], however, only 2
pages are allowed. Submission to the GECCO proceedings is not required
to participate in the competition, nor is it required to attend GECCO.
The announcement of the winner will be made during GECCO 2021.

We hope that you will have fun participating in this challenge! The
deadline is Saturday June, 27 2021 (anywhere in the world). For more
information please visit our webpage


Sender: Federico Divina <[log in to unmask]>
Subject: CfP: Special issue on "Application of Evolutionary Computation"

Special Issue on "Application of Evolutionary Computation"

A special issue of Applied Sciences (IF 2.474 ISSN 2076-3417).
This special issue belongs to the section "Computing and Artificial

Deadline for manuscript submissions: 30 June 2021.
Guest Editors
Federico Divina and Francisco A. Gómez Vela
(Pablo de Olavide University - Spain)

Dear Colleagues,

Evolutionary Computation has been applied to a wide range of real-life
problems, ranging from telecommunication networks to complex systems,
finance and economics, games, image analysis, evolutionary music and
art, parameter optimization, bioinformatics, scheduling, and

The aim of this Special Issue is to present a collection of studies
describing the latest advances in techniques and applications of
Genetic Algorithms, Evolution Strategies, Evolutionary Programming,
Genetic Programming, Simulated Annealing, Ant Colony Optimization, and
related techniques. Of particular interest is the application of these
techniques to computationally difficult combinatorial problems.

We also encourage researchers to share their original work in the
field of computational analysis of gene expression data. Topics of
primary interest include, among others, the applications of:

genetic algorithms;
evolution strategies;
evolutionary programming;
memetic algorithms;
genetic programming;
ant colony optimization;
co-evolutionary algorithms;
artificial immune systems;
particle swarm optimization; and
classifier systems.
evolutionary computation;
soft computing;
real-life applications.

Sender: lehrepk <[log in to unmask]>
Subject: CFP: Special Issue on Theoretical Foundations of Evolutionary

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,


 - Send submissions (articles) to [log in to unmask]
 DO NOT send submissions to the [log in to unmask] address.

 - To subscribe send email to [log in to unmask] containing the
 following text in the body of the message:

   subscribe ec-digest-l <Your Name (up to 4 words)>

 - To unsubscribe send email to [log in to unmask] containing the
 following text in the body of the message:

   unsubscribe ec-digest-l

 - To change your email address, simply unsubscribe the old address
 and subscribe the new one.

 - Send other administrative requests to [log in to unmask]

 End of Evolutionary Computation Digest

Top of Message | Previous Page | Permalink

Advanced Options


Log In

Log In

Get Password

Get Password

Search Archives

Search Archives

Subscribe or Unsubscribe

Subscribe or Unsubscribe


May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
February 2022
November 2021
August 2021
May 2021
March 2021
January 2021
December 2020
November 2020
October 2020
September 2020
July 2020
June 2020
May 2020
April 2020
February 2020
January 2020
March 2019
February 2019
March 2018
February 2018
January 2018
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
January 2017
December 2016
November 2016
September 2016
July 2016
June 2016
May 2016
April 2016
March 2016
January 2016
September 2015
May 2015
March 2015
October 2014
September 2014
August 2014
June 2013
May 2013
March 2013
February 2013
January 2013
August 2012
June 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
April 2009
March 2009
February 2009
January 2009



CataList Email List Search Powered by the LISTSERV Email List Manager