Skip to main content
SpringerLink
Log in

Evolutionary Computation in Combinatorial Optimization

15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings

  • Conference proceedings
  • © 2015

Overview

Editors:
  1. Gabriela Ochoa

    1. University of Stirling, Stirling, United Kingdom

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Francisco Chicano

    1. University of Málaga, Málaga, Spain

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: EvoCOP 2015.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (19 papers)

  1. Front Matter

    Pages I-XII
    Download chapter PDF

  2. A Biased Random-Key Genetic Algorithm for the Cloud Resource Management Problem

    • Leonard Heilig, Eduardo Lalla-Ruiz, Stefan Voß
    Pages 1-12

  3. A Computational Comparison of Different Algorithms for Very Large \(p\)-median Problems

    • Pascal Rebreyend, Laurent Lemarchand, Reinhardt Euler
    Pages 13-24

  4. A New Solution Representation for the Firefighter Problem

    • Bin Hu, Andreas Windbichler, Günther R. Raidl
    Pages 25-35

  5. A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem

    • Matthias Prandtstetter, Ulrike Ritzinger, Peter Schmidt, Mario Ruthmair
    Pages 36-47

  6. A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands

    • Benjamin Biesinger, Bin Hu, Günther R. Raidl
    Pages 48-60

  7. An Iterated Local Search Algorithm for Solving the Orienteering Problem with Time Windows

    • Aldy Gunawan, Hoong Chuin Lau, Kun Lu
    Pages 61-73

  8. Analysis of Solution Quality of a Multiobjective Optimization-Based Evolutionary Algorithm for Knapsack Problem

    • Jun He, Yong Wang, Yuren Zhou
    Pages 74-85

  9. Evolving Deep Recurrent Neural Networks Using Ant Colony Optimization

    • Travis Desell, Sophine Clachar, James Higgins, Brandon Wild
    Pages 86-98

  10. Hyper-heuristic Operator Selection and Acceptance Criteria

    • Richard J. Marshall, Mark Johnston, Mengjie Zhang
    Pages 99-113

  11. Improving the Performance of the Germinal Center Artificial Immune System Using \(\epsilon \)-Dominance: A Multi-objective Knapsack Problem Case Study

    • Ayush Joshi, Jonathan E. Rowe, Christine Zarges
    Pages 114-125

  12. Mixing Network Extremal Optimization for Community Structure Detection

    • Mihai Suciu, Rodica Ioana Lung, Noémi Gaskó
    Pages 126-137

  13. Multi-start Iterated Local Search for the Mixed Fleet Vehicle Routing Problem with Heterogenous Electric Vehicles

    • Ons Sassi, W. Ramdane Cherif-Khettaf, Ammar Oulamara
    Pages 138-149

  14. On the Complexity of Searching the Linear Ordering Problem Neighborhoods

    • Benjamin Correal, Philippe Galinier
    Pages 150-159

  15. Runtime Analysis of \((1+1)\) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem

    • Denis Antipov, Maxim Buzdalov, Benjamin Doerr
    Pages 160-172

  16. The New Memetic Algorithm \(HEAD\) for Graph Coloring: An Easy Way for Managing Diversity

    • Laurent Moalic, Alexandre Gondran
    Pages 173-183

  17. The Sim-EA Algorithm with Operator Autoadaptation for the Multiobjective Firefighter Problem

    • Krzysztof Michalak
    Pages 184-196

  18. True Pareto Fronts for Multi-objective AI Planning Instances

    • Alexandre Quemy, Marc Schoenauer
    Pages 197-208

  19. Upper and Lower Bounds on Unrestricted Black-Box Complexity of Jump \(_{n,\ell }\)

    • Maxim Buzdalov, Mikhail Kever, Benjamin Doerr
    Pages 209-221

  20. Using Local Search to Evaluate Dispatching Rules in Dynamic Job Shop Scheduling

    • Rachel Hunt, Mark Johnston, Mengjie Zhang
    Pages 222-233
Back to top

Other volumes

  1. Evolutionary Computation in Combinatorial Optimization

Keywords

About this book

This book constitutes the refereed proceedings of the 15th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2015, held in Copenhagen, Denmark, in April 2015, co-located with the Evo*2015 events EuroGP, EvoMUSART and EvoApplications.

The 19 revised full papers presented were carefully reviewed and selected from 46 submissions. The papers cover methodology, applications and theoretical studies. The methods included evolutionary and memetic (hybrid) algorithms, iterated local search, variable neighbourhood search, ant colony optimization, artificial immune systems, hyper-heuristics and other adaptive approaches. The applications include both traditional domains, such as graph coloring, knapsack, vehicle routing, job-shop scheduling, the p-median and the orienteering problems; and new(er) domains such as designing deep recurrent neural networks, detecting network community structure, lock scheduling of ships, cloud resource management, the fire-fighter problem and AI planning. The theoretical studies involved approximation ratio, runtime and black-box complexity analyses.

Editors and Affiliations

  • University of Stirling, Stirling, United Kingdom

    Gabriela Ochoa

  • University of Málaga, Málaga, Spain

    Francisco Chicano

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation