Skip to main content
SpringerLink
Log in

Evolutionary Computation in Combinatorial Optimization

16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings

  • Conference proceedings
  • © 2016

Overview

Editors:
  1. Francisco Chicano

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Bin Hu

    1. Austrian Insttitute of Technology, Vienna, Austria

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Pablo García-Sánchez

    1. University of Granada, Granada, 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 9595)

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

Included in the following conference series:

Conference proceedings info: EvoCOP 2016.

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 (17 papers)

  1. Front Matter

    Pages I-XII
    Download chapter PDF

  2. A Hybrid Constructive Mat-heuristic Algorithm for the Heterogeneous Vehicle Routing Problem with Simultaneous Pick-up and Delivery

    • Baris Kececi, Fulya Altiparmak, Imdat Kara
    Pages 1-17

  3. A Property Preserving Method for Extending a Single-Objective Problem Instance to Multiple Objectives with Specific Correlations

    • Ruby L. V. Moritz, Enrico Reich, Matthias Bernt, Martin Middendorf
    Pages 18-33

  4. An Evolutionary Approach to the Full Optimization of the Traveling Thief Problem

    • Nuno Lourenço, Francisco B. Pereira, Ernesto Costa
    Pages 34-45

  5. Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem

    • Christian Blum, Maria J. Blesa
    Pages 46-57

  6. Deconstructing the Big Valley Search Space Hypothesis

    • Gabriela Ochoa, Nadarajen Veerapen
    Pages 58-73

  7. Determining the Difficulty of Landscapes by PageRank Centrality in Local Optima Networks

    • Sebastian Herrmann
    Pages 74-87

  8. Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization

    • Francisco Chicano, Darrell Whitley, Renato Tinós
    Pages 88-103

  9. Evaluating Hyperheuristics and Local Search Operators for Periodic Routing Problems

    • Yujie Chen, Philip Mourdjis, Fiona Polack, Peter Cowling, Stephen Remde
    Pages 104-120

  10. Evolutionary Algorithms for Finding Short Addition Chains: Going the Distance

    • Stjepan Picek, Carlos A. Coello Coello, Domagoj Jakobovic, Nele Mentens
    Pages 121-137

  11. Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems

    • Anton V. Eremeev, Julia V. Kovalenko
    Pages 138-153

  12. Hyperplane Elimination for Quickly Enumerating Local Optima

    • Brian W. Goldman, William F. Punch
    Pages 154-169

  13. Limits to Learning in Reinforcement Learning Hyper-heuristics

    • Fawaz Alanazi, Per Kristian Lehre
    Pages 170-185

  14. Modifying Colourings Between Time-Steps to Tackle Changes in Dynamic Random Graphs

    • Bradley Hardy, Rhyd Lewis, Jonathan Thompson
    Pages 186-201

  15. Particle Swarm Optimisation with Sequence-Like Indirect Representation for Web Service Composition

    • Alexandre Sawczuk da Silva, Yi Mei, Hui Ma, Mengjie Zhang
    Pages 202-218

  16. Particle Swarm Optimization for Multi-Objective Web Service Location Allocation

    • Boxiong Tan, Yi Mei, Hui Ma, Mengjie Zhang
    Pages 219-234

  17. Sim-EDA: A Multipopulation Estimation of Distribution Algorithm Based on Problem Similarity

    • Krzysztof Michalak
    Pages 235-250

  18. Solving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization

    • Danny Munera, Daniel Diaz, Salvador Abreu
    Pages 251-266

  19. Back Matter

    Pages 267-267
    Download chapter PDF
Back to top

Other volumes

  1. Evolutionary Computation in Combinatorial Optimization

Keywords

About this book

This book constitutes the refereed proceedings of the 16th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2016, held in Porto, Portugal, in March/April 2016, co-located with the Evo*2015 events EuroGP, EvoMUSART and EvoApplications.
The 17 revised full papers presented were carefully reviewed and selected from 44 submissions. The papers cover methodology, applications and theoretical studies. The methods included evolutionary and memetic algorithms, variable neighborhood search, particle swarm optimization, hyperheuristics, mat-heuristic and other adaptive approaches. Applications included both traditional domains, such as graph coloring, vehicle routing, the longest common subsequence problem, the quadratic assignment problem; and new(er) domains such as the traveling thief problem, web service location, and finding short addition chains. The theoretical studies involved fitness landscape analysis, local search and recombination operator analysis, and the big valley search space hypothesis. The consideration of multiple objectives, dynamic and noisy environments was also present in a number of articles.

Editors and Affiliations

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

    Francisco Chicano

  • Austrian Insttitute of Technology, Vienna, Austria

    Bin Hu

  • University of Granada, Granada, Spain

    Pablo García-Sánchez

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation