Evostar 2018


The Leading European Event on Bio-Inspired Computation. Parma, Italy. 4-6 April 2018.

Call for papers:

EvoCOP

The 18th European Conference on Evolutionary Computation in Combinatorial Optimisation

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

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

EvoCOP Programme Chairs

  • Arnaud Liefooghe, University of Lille, France, arnaud.liefooghe (at) univ-lille1.fr
  • Manuel López-Ibáñez, University of Manchester, UK, manuel.lopez-ibanez (at) manchester.ac.uk

Programme Committee

  • Adnan Acan, Eastern Mediterranean University, Turkey
  • Hernán Aguirre, Shinshu University, France
  • Enrique Alba, Universidad de Málaga, Spain
  • Richard Allmendinger, University of Manchester, UK
  • Thomas Bartz-Beielstein, Cologne University of Applied Sciences, Germany
  • Hans-Georg Beyer, Vorarlberg University of Applied Sciences, Germany
  • Benjamin Biesinger, Austrian Institute of Technology, Austria
  • Christian Blum, Artificial Intelligence Research Institute (IIIA-CSIC), Bellaterra, Spain
  • Sandy Brownlee, University of Stirling, UK
  • Pedro Castillo, Universidad de Granada, Spain
  • Francisco Chicano, Universidad de Malaga, Spain
  • Carlos Coello Coello, CINVESTAV-IPN, Mexico
  • Peter Cowling, University of Bradford, UK
  • Bilel Derbel, University of Lille, France
  • Luca Di Gaspero, University of Udine, Italy
  • Karl Doerner, Johannes Kepler University Linz, Austria
  • Benjamin Doerr, LIX-Ecole Polytechnique, France
  • Carola Doerr, Max Planck Institute for Informatics, Germany
  • Paola Festa, Universitá di Napoli Federico II, Italy
  • Bernd Freisleben, University of Marburg, Germany
  • Carlos Garcia-Martinez, University of Córdoba, Spain
  • Adrien Goeffon, University of Angers, France
  • Jens Gottlieb, SAP, Germany
  • Walter Gutjahr, University of Vienna, Austria
  • Said Hanafi, University of Valenciennes, France
  • Jin-Kao Hao, University of Angers, France
  • Emma Hart, Edinburgh Napier University, UK
  • Geir Hasle, SINTEF Applied Mathematics, Norway
  • Bin Hu, Austrian Institute of Technology, Austria
  • Andrzej Jaszkiewicz, Poznan University of Technology, Poland
  • Istvan Juhos, University of Szeged, Hungary
  • Graham Kendall, University of Nottingham, UK
  • Ahmed Kheiri, Lancaster University, UK
  • Mario Koeppen, Kyushu Institute of Technology, Japan
  • Frederic Lardeux, University of Angers, France
  • Rhyd Lewis, Cardiff University, UK
  • Arnaud Liefooghe, University of Lille, France
  • Manuel López-Ibáñez, University of Manchester, UK
  • Jose Antonio Lozano, University of the Basque Country, Spain
  • Gabriel Luque, University of Malaga, Spain
  • David Meignan, University of Osnabruck, Germany
  • Juan Julian Merelo, University of Granada, Spain
  • Krzysztof Michalak, University of Economics, Wroclaw, Poland
  • Martin Middendorf, University of Leipzig, Germany
  • Christine L. Mumford, Cardiff University, UK
  • Nysret Musliu, Vienna University of Technology, Austria
  • Gabriela Ochoa, University of Stirling, UK
  • Beatrice Ombuki-Berman, Brock University, Canada
  • Luis Paquete, University of Coimbra, Portugal
  • Mario Pavone, University of Catania, Italy
  • Paola Pellegrini, French institute of science and technology for transport, France
  • Francisco J. Pereira, Universidade de Coimbra, Portugal
  • Matthias Prandtstetter, Austrian Institute of Technology, Austria
  • Jakob Puchinger, SystemX-Centrale Supélec, France
  • Günther Raidl, Vienna University of Technology, Austria
  • Maria Cristina Riff, Universidad Técnica Federico Santa María, Chile
  • Eduardo Rodriguez-Tello, CINVESTAV – Tamaulipas, Mexico
  • Andrea Roli, Università di Bologna, Italy
  • Peter Ross, Edinburgh Napier University, UK
  • Frederic Saubion, University of Angers, France
  • Patrick Siarry, University of Paris 12, France
  • Kevin Sim, Edinburgh Napier University, UK
  • Jim Smith, University of the West of England, UK
  • Giovanni Squillero, Politecnico di Torino, Italy
  • Thomas Stuetzle, Université Libre de Bruxelles, Belgium
  • El-ghazali Talbi, University of Lille, France
  • Sara Tari, University of Angers, France
  • Renato Tinós, University of Sao Paulo, Brasil
  • Nadarajen Veerapen, University of Stirling, UK
  • Sébastien Verel, Université du Littoral Cote d'Opale, France
  • Bing Xue, Victoria University of Wellington, New Zealand
  • Takeshi Yamada, NTT Communication Science Laboratories, Japan




Publication Details

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 and 10197 for the previous proceedings).

Late-breaking abstracts (LBAs) summarising 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 posters during the conference.

Submission Details

Regular 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 page
Submission link: http://myreview.saclay.inria.fr/evocop18/

Submission link: https://myreview.saclay.inria.fr/evocop18/

Important Dates

  • Submission deadline (Regular papers): November 1, 2017
  • EXTENDED Submission deadline (Regular papers): November 10, 2017
  • Notification (Regular papers): 3 January 2018
  • Camera-ready (Regular papers): 15 January 2018
  • Submission deadline (Late-breaking abstracts): January 15, 2018
  • Notification (Late-breaking abstracts): TBA
  • Camera-ready (Late-breaking abstracts): TBA
  • Mandatory registration per paper: 1 February 2017
  • Student bursary deadline: TBA
  • Early registration discount: TBA
  • Registration deadline: TBA
  • EvoStar dates: 4-6 April 2018

Important dates:

Submission Deadline: 1 November 2017
EXTENDED 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

Twitter: