Evolutionary Computation in Combinatorial Optimization: 9th European Conference, EvoCOP 2009, Tübingen, Germany, April 15-17, 2009. Proceedings

✍ Scribed by Zhipeng Lü, Jin-Kao Hao (auth.), Carlos Cotta, Peter Cowling (eds.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 2009
• Tongue: English
• Leaves: 264
• Series: Lecture Notes in Computer Science 5482 Theoretical Computer Science and General Issues
• Edition: 1
• Category: Library

✦ Synopsis

This book constitutes the refereed proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2009, held in Tübingen, Germany, in April 2009.

The 21 revised full papers presented were carefully reviewed and selected from 53 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 Critical Element-Guided Perturbation Strategy for Iterated Local Search....Pages 1-12
A Genetic Algorithm for Net Present Value Maximization for Resource Constrained Projects....Pages 13-24
A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse....Pages 25-36
A New Binary Description of the Blocks Relocation Problem and Benefits in a Look Ahead Heuristic....Pages 37-48
A Plasmid Based Transgenetic Algorithm for the Biobjective Minimum Spanning Tree Problem....Pages 49-60
A Tabu Search Algorithm with Direct Representation for Strip Packing....Pages 61-72
An ACO Approach to Planning....Pages 73-84
An Artificial Immune System for the Multi-Mode Resource-Constrained Project Scheduling Problem....Pages 85-96
Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows....Pages 97-108
Binary Exponential Back Off for Tabu Tenure in Hyperheuristics....Pages 109-120
Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms....Pages 121-132
Divide-And-Evolve Facing State-of-the-Art Temporal Planners during the 6 th International Planning Competition....Pages 133-144
Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm....Pages 145-155
Finding Balanced Incomplete Block Designs with Metaheuristics....Pages 156-167
Guided Ejection Search for the Job Shop Scheduling Problem....Pages 168-179
Improving Performance in Combinatorial Optimisation Using Averaging and Clustering....Pages 180-191
Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks....Pages 192-203
Metropolis and Symmetric Functions: A Swan Song....Pages 204-215
Robustness Analysis in Evolutionary Multi-Objective Optimization Applied to VAR Planning in Electrical Distribution Networks....Pages 216-227
Staff Scheduling with Particle Swarm Optimisation and Evolution Strategies....Pages 228-239
University Course Timetabling with Genetic Algorithm: A Laboratory Excercises Case Study....Pages 240-251
Back Matter....Pages -

✦ Subjects

Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Numeric Computing; Discrete Mathematics in Computer Science; Computational Biology/Bioinformatics