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

by Hemert, Jano Van; Cotta, Carlos

• ISBN13: 9783540786030
• ISBN10: 3540786031
• Format: Paperback
• Copyright: 2008-05-04
• Publisher: Springer Verlag

Summary

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

Adaptive Tabu Tenure Computation in Local Search	p. 1
A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems	p. 13
Cooperative Particle Swarm Optimization for the Delay Constrained Least Cost Path Problem	p. 25
Effective Neighborhood Structures for the Generalized Traveling Salesman Problem	p. 36
Efficient Local Search Limitation Strategies for Vehicle Routing Problems	p. 48
Evolutionary Local Search for the Minimum Energy Broadcast Problem	p. 61
Exploring Multi-objective PSO and GRASP-PR for Rule Induction	p. 73
An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem	p. 85
Graph Colouring Heuristics Guided by Higher Order Graph Properties	p. 97
A Hybrid Column Generation Approach for the Berth Allocation Problem	p. 110
Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem	p. 123
An ILS Based Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Limit	p. 135
An Immune Genetic Algorithm Based on Bottleneck Jobs for the Job Shop Scheduling Problem	p. 147
Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem	p. 158
Improving Metaheuristic Performance by Evolving a Variable Fitness Function	p. 170
Improving Query Expansion with Stemming Terms: A New Genetic Algorithm Approach	p. 182
Inc*: An Incremental Approach for Improving Local Search Heuristics	p. 194
Metaheuristics for the Bi-objective Ring Star Problem	p. 206
Multiobjective Prototype Optimization with Evolved Improvement Steps	p. 218
Optimising Multiple Kernels for SVM by Genetic Programming	p. 230
Optimization of Menu Layouts by Means of Genetic Algorithms	p. 242
A Path Relinking Approach with an Adaptive Mechanism to Control Parameters for the Vehicle Routing Problem with Time Windows	p. 254
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem	p. 266
Solving Graph Coloring Problems Using Learning Automata	p. 277
Author Index	p. 289
Table of Contents provided by Blackwell. All Rights Reserved.