Evolutionary Computation in Combinatorial Optimization: 8th European Conference, EvoCOP 2008, Naples, Italy, March 26-28, 2008. Proceedings

✍ Scribed by Isabelle Devarenne, Hakim Mabed (auth.), Jano van Hemert, Carlos Cotta (eds.)

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

✦ Synopsis

This book constitutes the refereed proceedings of the 8th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2008, held in Naples, Italy, in March 2008.

The 24 revised full papers presented were carefully reviewed and selected from 69 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 -
Adaptive Tabu Tenure Computation in Local Search....Pages 1-12
A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems....Pages 13-24
Cooperative Particle Swarm Optimization for the Delay Constrained Least Cost Path Problem....Pages 25-35
Effective Neighborhood Structures for the Generalized Traveling Salesman Problem....Pages 36-47
Efficient Local Search Limitation Strategies for Vehicle Routing Problems....Pages 48-60
Evolutionary Local Search for the Minimum Energy Broadcast Problem....Pages 61-72
Exploring Multi-objective PSO and GRASP-PR for Rule Induction....Pages 73-84
An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem....Pages 85-96
Graph Colouring Heuristics Guided by Higher Order Graph Properties....Pages 97-109
A Hybrid Column Generation Approach for the Berth Allocation Problem....Pages 110-122
Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem....Pages 123-134
An ILS Based Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Limit....Pages 135-146
An Immune Genetic Algorithm Based on Bottleneck Jobs for the Job Shop Scheduling Problem....Pages 147-157
Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem....Pages 158-169
Improving Metaheuristic Performance by Evolving a Variable Fitness Function....Pages 170-181
Improving Query Expansion with Stemming Terms: A New Genetic Algorithm Approach....Pages 182-193
Inc*: An Incremental Approach for Improving Local Search Heuristics....Pages 194-205
Metaheuristics for the Bi-objective Ring Star Problem....Pages 206-217
Multiobjective Prototype Optimization with Evolved Improvement Steps....Pages 218-229
Optimising Multiple Kernels for SVM by Genetic Programming....Pages 230-241
Optimization of Menu Layouts by Means of Genetic Algorithms....Pages 242-253
A Path Relinking Approach with an Adaptive Mechanism to Control Parameters for the Vehicle Routing Problem with Time Windows....Pages 254-265
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem....Pages 266-276
Solving Graph Coloring Problems Using Learning Automata....Pages 277-288
Back Matter....Pages -

✦ Subjects

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