EvoCOP 2020 - The 20th European Conference on Evolutionary Computation in Combinatorial Optimisation

Страна: Испания

Город: Seville

Тезисы до: 01.11.2019

Даты: 15.04.20 — 17.04.20

Е-мейл Оргкомитета: paquete@dei.uc.pt

Организаторы: EvoCOP Committee - http://www.evostar.org/2020/?page_id=70

 

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

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

The EvoCOP 2020 conference will be held in the city of Seville, Spain, together with EuroGP (the 23rd European Conference on Genetic Programming), EvoMUSART (the 9th European conference on evolutionary and biologically inspired music, sound, art and design) and EvoApplications (the 23rd European Conference on the Applications of Evolutionary Computation), in a joint event collectively known as EvoStar (Evo*).

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

* Applications of metaheuristics to combinatorial optimization 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 optimisation
* Artificial immune systems
* Local search methods such as simulated annealing, tabu search, variable neighbourhood search, iterated local search, scatter search and path relinking
* Hybrid methods such as memetic algorithms
* Matheuristics (hybrids of exact and heuristic methods)
* Hyper-heuristics and autonomous search
* Surrogate-model-based methods

Веб-сайт конференции: http://www.evostar.org/2020/?page_id=8