This book constitutes the refereed proceedings of the 6th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2006, held in Budapest, Hungary in April 2006.
The 24 revised full papers presented were carefully reviewed and selected from 77 submissions. The papers cover evolutionary algorithms as well as various other metaheuristics, like scatter search, tabu search, memetic algorithms, variable neighborhood search, greedy randomized adaptive search procedures, ant colony optimization, and particle swarm optimization algorithms. The papers deal with representations, heuristics, analysis of problem structures, and comparisons of algorithms. The list of studied combinatorial optimization problems includes prominent examples like graph coloring, knapsack problems, the traveling salesperson problem, scheduling, graph matching, as well as specific real-world problems.
Author(s): Michael Armbruster, Marzena Fügenschuh (auth.), Jens Gottlieb, Günther R. Raidl (eds.)
Series: Lecture Notes in Computer Science 3906
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2006
Language: English
Pages: 296
Tags: Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Numeric Computing; Discrete Mathematics in Computer Science
Front Matter....Pages -
Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem....Pages 1-12
The Trade Off Between Diversity and Quality for Multi-objective Workforce Scheduling....Pages 13-24
Evolving the Structure of the Particle Swarm Optimization Algorithms....Pages 25-36
A Tabu Search Algorithm for Optimization of Gas Distribution Networks....Pages 37-48
Design of a Retail Chain Stocking Up Policy with a Hybrid Evolutionary Algorithm....Pages 49-60
Parametrized GRASP Heuristics for Three-Index Assignment....Pages 61-72
A Memetic Algorithm with Bucket Elimination for the Still Life Problem....Pages 73-85
Effects of Scale-Free and Small-World Topologies on Binary Coded Self-adaptive CEA....Pages 86-98
Particle Swarm for the Traveling Salesman Problem....Pages 99-110
Hierarchical Cellular Genetic Algorithm....Pages 111-122
Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation....Pages 123-134
Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes: A Hybrid Genetic Approach....Pages 135-146
A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems....Pages 147-158
New Computational Results for the Nurse Scheduling Problem: A Scatter Search Algorithm....Pages 159-170
Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems....Pages 171-182
A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem....Pages 183-194
The Core Concept for the Multidimensional Knapsack Problem....Pages 195-208
Multiobjective Scheduling of Jobs with Incompatible Families on Parallel Batch Machines....Pages 209-221
A Memetic Algorithm for the Biobjective Minimum Spanning Tree Problem....Pages 222-233
A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems....Pages 234-246
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning....Pages 247-260
A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems....Pages 261-271
An Efficient Hybrid Search Algorithm for Various Optimization Problems....Pages 272-283
A Hybrid VNS/Tabu Search Algorithm for Apportioning the European Parliament....Pages 284-292
Back Matter....Pages -
