Evostar 2020


The Leading European Event on Bio-Inspired Computation. Seville, Spain. 15-17 April 2020.

Call for papers:

EvoCOP

The 20th European Conference on Evolutionary Computation in Combinatorial Optimisation

Part of Evo* 2020 (http://www.evostar.org) including: EuroGP, EvoCOP, EvoMUSART and EvoApplications

The 20th European Conference on Evolutionary Computation in Combinatorial Optimisation is a multidisciplinary conference that brings together researchers working on evolutionary computation methods and other metaheuristics for solving difficult combinatorial optimisation problems appearing in various industrial, economic, and scientific domains. Prominent examples of metaheuristics include: evolutionary algorithms, estimation of distribution algorithms, swarm intelligence methods such as ant colony and particle swarm optimisation, local search methods such as simulated annealing, tabu search, variable neighbourhood search, iterated local search, scatter search and path relinking, and their hybridisation, such as memetic algorithms. Automatic algorithm configuration and design, meta-optimisation, model-based methods, and hyperheuristics are also topics of interest. 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, graph problems, satisfiability, energy optimisation, cutting, packing, and planning problems.

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 Conference Proceedings in SpringerLink

Areas of Interest and Contributions

Topics of interest include, but are not limited to:

  • Applications of metaheuristics to combinatorial optimisation problems
  • Representation techniques
  • Practical solution of NP-hard problems
  • Neighbourhoods and efficient algorithms for searching them
  • Variation operators for stochastic search methods
  • Theoretical developments
  • Constraint-handling techniques
  • Parallelisation and grid computing
  • Search space and landscape analyses
  • Comparisons between different (also exact) methods
  • Heuristics
  • Genetic programming and Genetic algorithms
  • Tabu search, iterated local search and variable neighbourhood search
  • Ant colony optimisation
  • Artificial immune systems
  • Scatter search
  • Particle swarm optimisation
  • Memetic algorithms
  • Hybrid methods and hybridisation techniques
  • Matheuristics (hybrids of exact and heuristic methods)
  • Hyper-heuristics and autonomous search
  • Automatic algorithm configuration and design
  • Metaheuristics and machine learning
  • Surrogate-model-based methods
  • Estimation of distribution algorithms
  • String processing
  • Scheduling and timetabling
  • Network design
  • Vehicle routing
  • Graph problems
  • Satisfiability
  • Packing and cutting problems
  • Energy optimisation problems
  • Multi-objective optimisation
  • Search-based software engineering
Notice that, by tradition, continuous/numerical optimisation is *not* part of the topics of interest of EvoCOP. Interested authors might consider submitting to other EvoStar conferences such as EvoApplications.

EvoCOP Programme Chairs

  • Luís Paquete, University of Coimbra, Portugal, paquete(at)dei.uc.pt
  • Christine Zarges, Aberystwyth University, Wales, UK, chz8(at)aber.ac.uk

Programme Committee

To be decided

Publication Details

EvoCOP 2020 will accept two types of submissions:

Regular papers

Regular papers will be presented orally at the conference and printed in the proceedings published by Springer in the LNCS series (see LNCS volumes 2037, 2279, 2611, 3004, 3448, 3906, 4446, 4972, 5482, 6022, 6622, 7245, 7832, 8600, 9026, 9595, 10197, 10782 and 11452 for the previous proceedings).

Late breaking abstracts

Late-breaking abstracts (LBAs) summarise ongoing research, recent studies and applications of evolutionary computation and other meta-heuristics to real-world or academic combinatorial optimisation problems. LBAs will be presented as short talks during the conference.

Submission Details

Paper submissions must be original and not published elsewhere. The submissions will be peer reviewed by members of the program committee. The authors of accepted papers will have to improve their paper on the basis of the reviewers' comments and will be asked to send a camera ready version of their manuscripts. At least one author of each accepted work has to register for the conference, attend the conference and present the work.

The reviewing process will be double-blind, please omit information about the authors in the submitted paper. Submit your manuscript in Springer LNCS format.

  • Page limit (Regular papers): 16 pages
  • Page limit (LBAs): 1-2 pages

Important dates:

Submission Deadline: 1 November 2019