Chicano / Hu / García-Sánchez Evolutionary Computation in Combinatorial Optimization

16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings
1. Auflage 2016
ISBN: 978-3-319-30698-8
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 267 Seiten, eBook

Reihe: Theoretical Computer Science and General Issues

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.

Zielgruppe

Research

Autoren/Hrsg.

Chicano, Francisco

Hu, Bin

García-Sánchez, Pablo

Inhaltsverzeichnis

A Hybrid Constructive Mat-Heuristic Algorithm
for The Heterogeneous Vehicle Routing Problem with Simultaneous Pick-up and
Delivery.- A Property Preserving Method for Extending a Single-Objective Problem
Instance to Multiple Objectives with Specific Correlations.- An Evolutionary
Approach to the Full Optimization of the Traveling Thief Problem.- Construct,
Merge, Solve & Adapt: Application to the Repetition-Free Longest Common
Subsequence Problem.- Deconstructing the Big Valley Search Space Hypothesis.- Determining
the Difficulty of Landscapes by PageRank Centrality in Local Optima Networks.- Efficient
Hill Climber for Multi-Objective Pseudo-Boolean Optimization.- Evaluating
Hyperheuristics and Local Search Operators for Periodic Routing Problems.- Evolutionary
Algorithms for Finding Short Addition Chains: Going the Distance.- Experimental
Evaluation of Two Approaches to Optimal Recombination for Permutation
Problems.- Hyperplane Elimination for Quickly Enumerating Local Optima.- Limits
to Learning in Reinforcement Learning Hyperheuristics.- Modifying Colourings
between Time-Steps to Tackle Changes in Dynamic Random Graphs.- Particle Swarm
Optimisation with Sequence-Like Indirect Representation for Web Service
Composition.- Particle Swarm Optimization for Multi-Objective Web Service
Location Allocation.- Sim-EDA: A Multipopulation Estimation of Distribution Algorithm
Based on Problem Similarity.- Solving the Quadratic Assignment Problem with
Cooperative Parallel Extremal Optimization.