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

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.