Thisbook constitutes the refereed proceedings of the 16th European Conference onEvolutionary 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.
The17 revised full papers presented were carefully reviewed and selected from 44submissions. The papers cover methodology, applications and theoretical studies. Themethods included evolutionary and memetic algorithms, variable neighborhoodsearch, particle swarm optimization, hyperheuristics, mat-heuristic and otheradaptive approaches. Applications included both traditional domains, such asgraph coloring, vehicle routing, the longest common subsequence problem, thequadratic assignment problem; and new(er) domains such as the traveling thiefproblem, web service location, and finding short addition chains. Thetheoretical studies involved fitness landscape analysis, local search and recombinationoperator analysis, and the big valley search space hypothesis. Theconsideration of multiple objectives, dynamic and noisy environments was alsopresent in a number of articles.
A Hybrid Constructive Mat-Heuristic Algorithmfor The Heterogeneous Vehicle Routing Problem with Simultaneous Pick-up andDelivery.- A Property Preserving Method for Extending a Single-Objective ProblemInstance to Multiple Objectives with Specific Correlations.- An EvolutionaryApproach to the Full Optimization of the Traveling Thief Problem.- Construct,Merge, Solve & Adapt: Application to the Repetition-Free Longest CommonSubsequence Problem.- Deconstructing the Big Valley Search Space Hypothesis.- Determiningthe Difficulty of Landscapes by PageRank Centrality in Local Optima Networks.- EfficientHill Climber for Multi-Objective Pseudo-Boolean Optimization.- EvaluatingHyperheuristics and Local Search Operators for Periodic Routing Problems.- EvolutionaryAlgorithms for Finding Short Addition Chains: Going the Distance.- ExperimentalEvaluation of Two Approaches to Optimal Recombination for PermutationProblems.- Hyperplane Elimination for Quickly Enumerating Local Optima.- Limitsto Learning in Reinforcement Learning Hyperheuristics.- Modifying Colouringsbetween Time-Steps to Tackle Changes in Dynamic Random Graphs.- Particle SwarmOptimisation with Sequence-Like Indirect Representation for Web ServiceComposition.- Particle Swarm Optimization for Multi-Objective Web ServiceLocation Allocation.- Sim-EDA: A Multipopulation Estimation of Distribution AlgorithmBased on Problem Similarity.- Solving the Quadratic Assignment Problem withCooperative Parallel Extremal Optimization.
