The 18th European Conference on Evolutionary Computation in Combinatorial Optimisation
About
The 18th 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 2018 conference will be held in the city of Parma, Italy, together with EuroGP (the 21st European Conference on Genetic Programming), EvoMUSART (7th European conference on evolutionary and biologically inspired music, sound, art and design) and EvoApplications (specialist events on a range of evolutionary computation topics and applications), in a joint event collectively known as EvoStar (Evo*).
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
Important Dates
Submission Deadline: 10 November 2017
Notification: 3 January 2018
Camera-ready: 15 January 2018
Student bursary deadline: TBA
Early registration discount: TBA
Registration deadline: TBA
EvoStar dates: 4-6 April 2018