Evolutionary Computation in Combinatorial Optimization: 11th European Conference, EvoCOP 2011, Torino, Italy, April 27-29, 2011. Proceedings

✍ Scribed by Sadaf Naseem Jat, Shengxiang Yang (auth.), Peter Merz, Jin-Kao Hao (eds.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 2011
• Tongue: English
• Leaves: 279
• Series: Lecture Notes in Computer Science 6622
• Edition: 1
• Category: Library

✦ Synopsis

This book constitutes the refereed proceedings of the 11th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2011, held in Torino, Italy, in April 2011. The 22 revised full papers presented were carefully reviewed and selected from 42 submissions. The papers present the latest research and discuss current developments and applications in metaheuristics - a paradigm to effectively solve difficult combinatorial optimization problems appearing in various industrial, economical, and scientific domains. Prominent examples of metaheuristics are evolutionary algorithms, simulated annealing, tabu search, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms, and ant colony optimization.

✦ Table of Contents

Front Matter....Pages -
A Guided Search Non-dominated Sorting Genetic Algorithm for the Multi-Objective University Course Timetabling Problem....Pages 1-13
A Hybrid Dual-Population Genetic Algorithm for the Single Machine Maximum Lateness Problem....Pages 14-25
A Kolmogorov-Type Stability Measure for Evolutionary Algorithms....Pages 26-37
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem....Pages 38-47
Connectedness and Local Search for Bicriteria Knapsack Problems....Pages 48-59
Cutting Graphs Using Competing Ant Colonies and an Edge Clustering Heuristic....Pages 60-71
Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming....Pages 72-83
Evolutionary Multiobjective Route Planning in Dynamic Multi-hop Ridesharing....Pages 84-95
Experiments in Parallel Constraint-Based Local Search....Pages 96-107
Fitness-Probability Cloud and a Measure of Problem Hardness for Evolutionary Algorithms....Pages 108-117
Frequency Distribution Based Hyper-Heuristic for the Bin-Packing Problem....Pages 118-129
From Adaptive to More Dynamic Control in Evolutionary Algorithms....Pages 130-141
Geometric Generalisation of Surrogate Model Based Optimisation to Combinatorial Spaces....Pages 142-154
GPU-Based Approaches for Multiobjective Local Search Algorithms. A Case Study: The Flowshop Scheduling Problem....Pages 155-166
Local Search for Mixed-Integer Nonlinear Optimization: A Methodology and an Application....Pages 167-178
Multi-start Heuristics for the Two-Echelon Vehicle Routing Problem....Pages 179-190
NILS: A Neutrality-Based Iterated Local Search and Its Application to Flowshop Scheduling....Pages 191-202
Off-line and On-line Tuning: A Study on Operator Selection for a Memetic Algorithm Applied to the QAP....Pages 203-214
On Complexity of the Optimal Recombination for the Travelling Salesman Problem....Pages 215-225
Pareto Local Optima of Multiobjective NK-Landscapes with Correlated Objectives....Pages 226-237
Quick-ACO: Accelerating Ant Decisions and Pheromone Updates in ACO....Pages 238-249
Two Iterative Metaheuristic Approaches to Dynamic Memory Allocation for Embedded Systems....Pages 250-261
Back Matter....Pages -

✦ Subjects

Algorithm Analysis and Problem Complexity; Computation by Abstract Devices; Pattern Recognition; Discrete Mathematics in Computer Science; Probability and Statistics in Computer Science