© 2017

Evolutionary Computation in Combinatorial Optimization

17th European Conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19-21, 2017, Proceedings

  • Bin Hu
  • Manuel López-Ibáñez
Conference proceedings EvoCOP 2017

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10197)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 10197)

Table of contents

  1. Front Matter
    Pages I-XII
  2. Daniel K. S. Vieira, Gustavo L. Soares, João A. Vasconcelos, Marcus H. S. Mendes
    Pages 18-29
  3. Gelareh Taghizadeh, Nysret Musliu
    Pages 30-43
  4. Wenxiang Chen, Darrell Whitley
    Pages 75-90
  5. Luís F. Simões, Dario Izzo, Evert Haasdijk, A. E. Eiben
    Pages 141-156
  6. Benjamin Biesinger, Bin Hu, Martin Stubenschrott, Ulrike Ritzinger, Matthias Prandtstetter
    Pages 157-172
  7. John H. Drake, Jerry Swan, Geoff Neumann, Ender Özcan
    Pages 189-200
  8. Pedro Pinacho Davidson, Christian Blum, José A. Lozano
    Pages 201-214
  9. Arnaud Liefooghe, Bilel Derbel, Sébastien Verel, Hernán Aguirre, Kiyoshi Tanaka
    Pages 215-232
  10. Gabriela Ochoa, Nadarajen Veerapen, Fabio Daolio, Marco Tomassini
    Pages 233-248
  11. Back Matter
    Pages 249-249

About these proceedings


This book constitutes the refereed proceedings of the 17th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2017, held in Amsterdam, The Netherlands, in April 2017, co-located with the Evo*2017 events EuroGP, EvoMUSART and EvoApplications.

The 16 revised full papers presented were carefully reviewed and selected from 39 submissions. The papers cover both empirical and theoretical studies on a wide range of academic and real-world applications. The methods include evolutionary and memetic algorithms, large neighborhood search, estimation of distribution algorithms, beam search, ant colony optimization, hyper-heuristics and matheuristics. Applications include both traditional domains, such as knapsack problem, vehicle routing, scheduling problems and SAT; and newer domains such as the traveling thief problem, location planning for car-sharing systems and spacecraft trajectory optimization. Papers also study important concepts such as pseudo-backbones, phase transitions in local optima networks, and the analysis of operators. This wide range of topics makes the EvoCOP proceedings an important source for current research trends in combinatorial optimization.


combinatorial optimization discrete space search evolutionary algorithms metaheuristics particle swarm optimisation algorithms ant colony optimization estimation of distribution algorithms graph problem hyper-heuristics linear programming matheuristics memetic algorithm multi-objective optimization optimization problems permutation problems quadratic assignment routing search methodologies vehicle routing

Editors and affiliations

  • Bin Hu
    • 1
  • Manuel López-Ibáñez
    • 2
  1. 1.Austrian Institute of TechnologyViennaAustria
  2. 2.University of ManchesterManchesterUnited Kingdom

Bibliographic information