Evolutionary Computation in Combinatorial Optimization: 15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings

✍ Scribed by Gabriela Ochoa, Francisco Chicano (eds.)

• Publisher: Springer International Publishing
• Year: 2015
• Tongue: English
• Leaves: 246
• Series: Lecture Notes in Computer Science 9026
• Edition: 1
• Category: Library

✦ Synopsis

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.

✦ Table of Contents

Front Matter....Pages I-XII
A Biased Random-Key Genetic Algorithm for the Cloud Resource Management Problem....Pages 1-12
A Computational Comparison of Different Algorithms for Very Large $$p$$ -median Problems....Pages 13-24
A New Solution Representation for the Firefighter Problem....Pages 25-35
A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem....Pages 36-47
A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands....Pages 48-60
An Iterated Local Search Algorithm for Solving the Orienteering Problem with Time Windows....Pages 61-73
Analysis of Solution Quality of a Multiobjective Optimization-Based Evolutionary Algorithm for Knapsack Problem....Pages 74-85
Evolving Deep Recurrent Neural Networks Using Ant Colony Optimization....Pages 86-98
Hyper-heuristic Operator Selection and Acceptance Criteria....Pages 99-113
Improving the Performance of the Germinal Center Artificial Immune System Using $$\epsilon $$ -Dominance: A Multi-objective Knapsack Problem Case Study....Pages 114-125
Mixing Network Extremal Optimization for Community Structure Detection....Pages 126-137
Multi-start Iterated Local Search for the Mixed Fleet Vehicle Routing Problem with Heterogenous Electric Vehicles....Pages 138-149
On the Complexity of Searching the Linear Ordering Problem Neighborhoods....Pages 150-159
Runtime Analysis of $$(1+1)$$ Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem....Pages 160-172
The New Memetic Algorithm $$HEAD$$ for Graph Coloring: An Easy Way for Managing Diversity....Pages 173-183
The Sim-EA Algorithm with Operator Autoadaptation for the Multiobjective Firefighter Problem....Pages 184-196
True Pareto Fronts for Multi-objective AI Planning Instances....Pages 197-208
Upper and Lower Bounds on Unrestricted Black-Box Complexity of Jump $$_{n,\ell }$$ ....Pages 209-221
Using Local Search to Evaluate Dispatching Rules in Dynamic Job Shop Scheduling....Pages 222-233
Back Matter....Pages 235-235

✦ Subjects

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