Evolutionary Computation in Combinatorial Optimization

13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013. Proceedings

  • Martin Middendorf
  • Christian Blum
Conference proceedings EvoCOP 2013

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

Table of contents

  1. Front Matter
  2. Ahmed Kheiri, Ender Özcan
    Pages 1-12
  3. Liam Cervante, Bing Xue, Lin Shang, Mengjie Zhang
    Pages 25-36
  4. Reza Abbasian, Malek Mouhoub
    Pages 37-48
  5. Wei Xiao, Wenqing Chu, Zhipeng Lü, Tao Ye, Guang Liu, Shanshan Cui
    Pages 49-60
  6. Mihai Suciu, Denis Pallez, Marcel Cremene, Dumitru Dumitrescu
    Pages 73-84
  7. Leonardo C. T. Bezerra, Manuel López-Ibáñez, Thomas Stützle
    Pages 85-96
  8. Marian Rainer-Harbach, Petrina Papazek, Bin Hu, Günther R. Raidl
    Pages 121-132
  9. Alejandro Arbelaez, Philippe Codognet
    Pages 157-168
  10. Shahriar Asta, Ender Özcan, Andrew J. Parkes, A. Şima Etaner-Uyar
    Pages 169-178
  11. Shalom Eliahou, Cyril Fonlupt, Jean Fromentin, Virginie Marion-Poty, Denis Robilliard, Fabien Teytaud
    Pages 191-201
  12. Mostepha R. Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant
    Pages 202-213
  13. Marc Reimann, Jose Eugenio Leal
    Pages 226-237
  14. Rommel D. Saraiva, Napoleão V. Nepomuceno, Plácido R. Pinheiro
    Pages 262-273
  15. Back Matter

About these proceedings


This book constitutes the refereed proceedings of the 13th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2013, held in Vienna, Austria, in April 2013, colocated with the Evo* 2013 events EuroGP, EvoBIO, EvoMUSART, and EvoApplications. The 23 revised full papers presented were carefully reviewed and selected from 50 submissions. The papers present the latest research and discuss current developments and applications in metaheuristics - a paradigm to effectively solve difficult combinatorial optimization problems appearing in various industrial, economic, and scientific domains. Prominent examples of metaheuristics are ant colony optimization, evolutionary algorithms, greedy randomized adaptive search procedures, iterated local search, simulated annealing, tabu search, and variable neighborhood search. Applications include scheduling, timetabling, network design, transportation and distribution, vehicle routing, the travelling salesman problem, packing and cutting, satisfiability, and general mixed integer programming.


genetic algorithms local search neighborhood search particle swarm optimization vehicle routing

Editors and affiliations

  • Martin Middendorf
    • 1
  • Christian Blum
    • 2
  1. 1.Department of Computer ScienceUniversity of LeipzigLeipzigGermany
  2. 2.IKERBASQUE, Basque Foundation for Science, Department of Computer Science and Artificial IntelligenceUniversity of the Basque CountryDonostiaSpain

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2013
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-37197-4
  • Online ISBN 978-3-642-37198-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site