Evolutionary Computation in Combinatorial Optimization: 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings

✍ Scribed by Francisco Chicano, Bin Hu, Pablo García-Sánchez (eds.)

• Publisher: Springer International Publishing
• Year: 2016
• Tongue: English
• Leaves: 279
• Series: Lecture Notes in Computer Science 9595
• Edition: 1
• Category: Library

✦ Synopsis

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.

✦ Table of Contents

Front Matter....Pages I-XII
A Hybrid Constructive Mat-heuristic Algorithm for the Heterogeneous Vehicle Routing Problem with Simultaneous Pick-up and Delivery....Pages 1-17
A Property Preserving Method for Extending a Single-Objective Problem Instance to Multiple Objectives with Specific Correlations....Pages 18-33
An Evolutionary Approach to the Full Optimization of the Traveling Thief Problem....Pages 34-45
Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem....Pages 46-57
Deconstructing the Big Valley Search Space Hypothesis....Pages 58-73
Determining the Difficulty of Landscapes by PageRank Centrality in Local Optima Networks....Pages 74-87
Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization....Pages 88-103
Evaluating Hyperheuristics and Local Search Operators for Periodic Routing Problems....Pages 104-120
Evolutionary Algorithms for Finding Short Addition Chains: Going the Distance....Pages 121-137
Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems....Pages 138-153
Hyperplane Elimination for Quickly Enumerating Local Optima....Pages 154-169
Limits to Learning in Reinforcement Learning Hyper-heuristics....Pages 170-185
Modifying Colourings Between Time-Steps to Tackle Changes in Dynamic Random Graphs....Pages 186-201
Particle Swarm Optimisation with Sequence-Like Indirect Representation for Web Service Composition....Pages 202-218
Particle Swarm Optimization for Multi-Objective Web Service Location Allocation....Pages 219-234
Sim-EDA: A Multipopulation Estimation of Distribution Algorithm Based on Problem Similarity....Pages 235-250
Solving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization....Pages 251-266
Back Matter....Pages 267-267

✦ Subjects

Numeric Computing; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Computation by Abstract Devices; Artificial Intelligence (incl. Robotics)