<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<meta name="Generator" content="Microsoft Word 14 (filtered medium)">
<style><!--
/* Font Definitions */
@font-face
{font-family:SimSun;
panose-1:2 1 6 0 3 1 1 1 1 1;}
@font-face
{font-family:SimSun;
panose-1:2 1 6 0 3 1 1 1 1 1;}
@font-face
{font-family:Calibri;
panose-1:2 15 5 2 2 2 4 3 2 4;}
@font-face
{font-family:"\@SimSun";
panose-1:2 1 6 0 3 1 1 1 1 1;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
{margin:0cm;
margin-bottom:.0001pt;
font-size:11.0pt;
font-family:"Calibri","sans-serif";}
a:link, span.MsoHyperlink
{mso-style-priority:99;
color:blue;
text-decoration:underline;}
a:visited, span.MsoHyperlinkFollowed
{mso-style-priority:99;
color:purple;
text-decoration:underline;}
span.EmailStyle17
{mso-style-type:personal-compose;
font-family:"Calibri","sans-serif";
color:windowtext;}
.MsoChpDefault
{mso-style-type:export-only;
font-family:"Calibri","sans-serif";}
@page WordSection1
{size:612.0pt 792.0pt;
margin:70.85pt 70.85pt 2.0cm 70.85pt;}
div.WordSection1
{page:WordSection1;}
--></style><!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]-->
</head>
<body lang="EN-US" link="blue" vlink="purple">
<div class="WordSection1">
<p class="MsoNormal">** Apologies for multiple copies **<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">************************************************************************<o:p></o:p></p>
<p class="MsoNormal"> EvoCOP 2017 - The 17th European Conference on<o:p></o:p></p>
<p class="MsoNormal"> Evolutionary Computation in Combinatorial Optimisation<o:p></o:p></p>
<p class="MsoNormal"> http://www.evostar.org/2017/cfp_evocop.php<o:p></o:p></p>
<p class="MsoNormal"> <o:p></o:p></p>
<p class="MsoNormal"> April 19 - April 21, 2017<o:p></o:p></p>
<p class="MsoNormal"> Amsterdam, The Netherlands<o:p></o:p></p>
<p class="MsoNormal"> <o:p></o:p></p>
<p class="MsoNormal"> Part of Evo* 2017 (http://www.evostar.org)<o:p></o:p></p>
<p class="MsoNormal">************************************************************************<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">The 17th European Conference on Evolutionary Computation in Combinatorial<o:p></o:p></p>
<p class="MsoNormal">Optimisation is a multidisciplinary conference that brings together researchers<o:p></o:p></p>
<p class="MsoNormal">working on evolutionary computation methods and other metaheuristics for<o:p></o:p></p>
<p class="MsoNormal">solving difficult combinatorial optimisation problems appearing in various<o:p></o:p></p>
<p class="MsoNormal">industrial, economic, and scientific domains. Prominent examples of<o:p></o:p></p>
<p class="MsoNormal">metaheuristics include: evolutionary algorithms, estimation of distribution<o:p></o:p></p>
<p class="MsoNormal">algorithms, swarm intelligence methods such as ant colony and particle swarm<o:p></o:p></p>
<p class="MsoNormal">optimisation, local search methods such as simulated annealing, tabu search,<o:p></o:p></p>
<p class="MsoNormal">variable neighbourhood search, iterated local search, scatter search and path<o:p></o:p></p>
<p class="MsoNormal">relinking, and their hybridisation, such as memetic algorithms. Automatic<o:p></o:p></p>
<p class="MsoNormal">algorithm configuration and design, meta-optimisation, model-based methods, and<o:p></o:p></p>
<p class="MsoNormal">hyperheuristics are also of interest. Successfully solved problems include, but<o:p></o:p></p>
<p class="MsoNormal">are not limited to, multi-objective, uncertain, dynamic and stochastic problems<o:p></o:p></p>
<p class="MsoNormal">in the context of scheduling, timetabling, network design, transportation and<o:p></o:p></p>
<p class="MsoNormal">distribution, vehicle routing, graph problems, satisfiability, energy<o:p></o:p></p>
<p class="MsoNormal">optimisation, cutting, packing, and planning problems.<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">The EvoCOP 2017 conference will be held in the city of Amsterdam, The<o:p></o:p></p>
<p class="MsoNormal">Netherlands. It will be held in conjunction with EuroGP (the 20th European<o:p></o:p></p>
<p class="MsoNormal">Conference on Genetic Programming), EvoMUSART (15th European conference on<o:p></o:p></p>
<p class="MsoNormal">evolutionary and biologically inspired music, sound, art and design) and<o:p></o:p></p>
<p class="MsoNormal">EvoApplications (specialist events on a range of evolutionary computation<o:p></o:p></p>
<p class="MsoNormal">topics and applications), in a joint event collectively known as EvoStar (Evo*).<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">**** Areas of Interest and Contributions ****<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">Topics of interest include, but are not limited to:<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">* Applications of metaheuristics to combinatorial optimisation problems<o:p></o:p></p>
<p class="MsoNormal">* Representation techniques<o:p></o:p></p>
<p class="MsoNormal">* Practical solution of NP-hard problems<o:p></o:p></p>
<p class="MsoNormal">* Neighbourhoods and efficient algorithms for searching them<o:p></o:p></p>
<p class="MsoNormal">* Variation operators for stochastic search methods<o:p></o:p></p>
<p class="MsoNormal">* Theoretical developments<o:p></o:p></p>
<p class="MsoNormal">* Constraint-handling techniques<o:p></o:p></p>
<p class="MsoNormal">* Parallelisation and grid computing<o:p></o:p></p>
<p class="MsoNormal">* Search space and landscape analyses<o:p></o:p></p>
<p class="MsoNormal">* Comparisons between different (also exact) methods<o:p></o:p></p>
<p class="MsoNormal">* Heuristics<o:p></o:p></p>
<p class="MsoNormal">* Genetic programming and Genetic algorithms<o:p></o:p></p>
<p class="MsoNormal">* Tabu search, iterated local search and variable neighbourhood search<o:p></o:p></p>
<p class="MsoNormal">* Ant colony optimisation<o:p></o:p></p>
<p class="MsoNormal">* Artificial immune systems<o:p></o:p></p>
<p class="MsoNormal">* Scatter search<o:p></o:p></p>
<p class="MsoNormal">* Particle swarm optimisation<o:p></o:p></p>
<p class="MsoNormal">* Memetic algorithms<o:p></o:p></p>
<p class="MsoNormal">* Hybrid methods and hybridisation techniques<o:p></o:p></p>
<p class="MsoNormal">* Matheuristics (hybrids of exact and heuristic methods)<o:p></o:p></p>
<p class="MsoNormal">* Hyper-heuristics and autonomous search<o:p></o:p></p>
<p class="MsoNormal">* Automatic algorithm configuration and design<o:p></o:p></p>
<p class="MsoNormal">* Metaheuristics and machine learning<o:p></o:p></p>
<p class="MsoNormal">* Surrogate-model-based methods<o:p></o:p></p>
<p class="MsoNormal">* Estimation of distribution algorithms<o:p></o:p></p>
<p class="MsoNormal">* String processing<o:p></o:p></p>
<p class="MsoNormal">* Scheduling and timetabling<o:p></o:p></p>
<p class="MsoNormal">* Network design<o:p></o:p></p>
<p class="MsoNormal">* Vehicle routing<o:p></o:p></p>
<p class="MsoNormal">* Graph problems<o:p></o:p></p>
<p class="MsoNormal">* Satisfiability<o:p></o:p></p>
<p class="MsoNormal">* Packing and cutting problems<o:p></o:p></p>
<p class="MsoNormal">* Energy optimisation problems<o:p></o:p></p>
<p class="MsoNormal">* Multi-objective optimisation<o:p></o:p></p>
<p class="MsoNormal">* Search-based software engineering<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">**** Publication Details ****<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">All accepted papers will be presented orally at the conference and printed in<o:p></o:p></p>
<p class="MsoNormal">the proceedings published by Springer in the LNCS series (see LNCS volumes<o:p></o:p></p>
<p class="MsoNormal">2037, 2279, 2611, 3004, 3448, 3906, 4446, 4972, 5482, 6022, 6622, 7245, 7832,<o:p></o:p></p>
<p class="MsoNormal">8600, 9026 and 9595 for the previous proceedings).<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">**** Submission Details ****<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">Submissions must be original and not published elsewhere. The submissions will<o:p></o:p></p>
<p class="MsoNormal">be peer reviewed by members of the program committee. The authors of accepted<o:p></o:p></p>
<p class="MsoNormal">papers will have to improve their paper on the basis of the reviewers comments<o:p></o:p></p>
<p class="MsoNormal">and will be asked to send a camera ready version of their manuscripts. At least<o:p></o:p></p>
<p class="MsoNormal">one author of each accepted work has to register for the conference, attend the<o:p></o:p></p>
<p class="MsoNormal">conference and present the work.<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">The reviewing process will be double-blind, please omit information about the<o:p></o:p></p>
<p class="MsoNormal">authors in the submitted paper. Submit your manuscript in Springer LNCS format.<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">* Page limit: 16 pages<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">**** Important Dates ****<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">Submission deadline: November 1, 2016<o:p></o:p></p>
<p class="MsoNormal">EVO* event: April 19 - April 21, 2017<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">**** EvoCOP Programme Chairs ****<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"> Bin Hu<o:p></o:p></p>
<p class="MsoNormal"> Austrian Institute of Technology, Austria<o:p></o:p></p>
<p class="MsoNormal"> bin.hu(at)ait.ac.at<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"> Manuel López-Ibáñez<o:p></o:p></p>
<p class="MsoNormal"> University of Manchester, United Kingdom<o:p></o:p></p>
<p class="MsoNormal"> manuel.lopez-ibanez@manchester.ac.uk<o:p></o:p></p>
</div>
</body>
</html>