2nd Call for Papers: EvoCOP 2023 – The 23nd European Conference on Evolutionary Computation in Combinatorial Optimisation

Second Call for Papers:
EvoCOP 2023 – The 23nd European Conference on
Evolutionary Computation in Combinatorial Optimisation


April 12 – 14, 2023
held as part of EvoStar (http://www.evostar.org)

Venue: Brno, Czech Republic

** EvoCOP is CORE Rank B **

Submission deadline: November 1, 2022

The 23nd European Conference on Evolutionary Computation in Combinatorial
Optimisation is a multidisciplinary conference that brings together
working on applications and theory of evolutionary computation methods and
other metaheuristics for solving difficult combinatorial optimisation
appearing in various industrial, economic, and scientific domains.

Successfully solved problems include, but are not limited to,
uncertain, dynamic and stochastic problems in the context of scheduling,
timetabling, network design, transportation and distribution, vehicle
stringology, graphs, satisfiability, energy optimisation, cutting, packing,
planning and search-based software engineering.

The EvoCOP 2023 conference will be held somewhere on Earth, together
with EuroGP (the 26th European Conference on Genetic Programming), EvoMUSART
(the 12th European conference on evolutionary and biologically inspired
sound, art and design) and EvoApplications (the 26th European Conference on
Applications of Evolutionary Computation), and a special track on
Evolutionary Machine Learning in a joint event collectively known as
EvoStar (Evo*).

Accepted papers will be published by Springer Nature in the Lecture Notes in
Computer Science series. (See https://link.springer.com/conference/evocop
previous proceedings.)

Download the CFP in PDF format:

The best regular paper presented at EvoCOP 2023 will be distinguished
with a Best Paper Award.

EvoCOP conference is ranked B in the CORE 2021 ranking:

**** Areas of Interest and Contributions ****

EvoCOP welcomes submissions in all experimental and theoretical aspects of
evolutionary computation and other metaheuristics to combinatorial
problems, including (but not limited to) the following areas:

* Applications of metaheuristics to combinatorial optimisation problems
* Theoretical developments
* Neighbourhoods and efficient algorithms for searching them
* Variation operators for stochastic search methods
* Constraint-handling techniques
* Parallelisation and grid computing
* Search space and landscape analyses
* Comparisons between different (also exact) methods
* Automatic algorithm configuration and design

Prominent examples of metaheuristics include (but are not limited to):

* Evolutionary algorithms
* Estimation of distribution algorithms
* Swarm intelligence methods such as ant colony and particle swarm
* Artificial immune systems
* Local search methods such as simulated annealing, tabu search, variable
neighbourhood search, iterated local search, scatter search and path
* Hybrid methods such as memetic algorithms
* Matheuristics (hybrids of exact and heuristic methods)
* Hyper-heuristics and autonomous search
* Surrogate-model-based methods

Notice that, by tradition, continuous/numerical optimisation is *not* part
the topics of interest of EvoCOP. Interested authors might consider
to other EvoStar conferences such as EvoApplications.

**** Submission Details ****

Paper submissions must be original and not published elsewhere. The
will be peer reviewed by members of the program committee. The reviewing
process will be double-blind, please omit information about the authors in
submitted paper. Submit your manuscript in Springer LNCS format:

Page limit: 16 pages