Evolutionary Computation in Combinatorial Optimization: 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007. Proceedings

Enrique Alba, Gabriel Luque (auth.), Carlos Cotta, Jano van Hemert (eds.)0302974335

This book constitutes the refereed proceedings of the 7th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2007, held in Valencia, Spain in April 2007.

The 21 revised full papers presented were carefully reviewed and selected from 81 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 are specifically dedicated to the application of evolutionary computation and related methods to combinatorial optimization problems and cover any issue of metaheuristic for combinatorial optimization. They 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.

---

Table of contents :
Front Matter….Pages –
A New Local Search Algorithm for the DNA Fragment Assembly Problem….Pages 1-12
A Hybrid Immune-Based System for the Protein Folding Problem….Pages 13-24
A Genetic Algorithm for the Resource Renting Problem with Minimum and Maximum Time Lags….Pages 25-35
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem….Pages 36-47
Genetic Algorithms for Word Problems in Partially Commutative Groups….Pages 48-59
A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling….Pages 60-71
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges….Pages 72-83
Iterated k-Opt Local Search for the Maximum Clique Problem….Pages 84-95
Accelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem….Pages 96-107
Evolutionary Algorithms for Real-World Instances of the Automatic Frequency Planning Problem in GSM Networks….Pages 108-120
A New Metaheuristic for the Vehicle Routing Problem with Split Demands….Pages 121-129
Generation of Tree Decompositions by Iterated Local Search….Pages 130-141
Edge Assembly Crossover for the Capacitated Vehicle Routing Problem….Pages 142-153
Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms….Pages 154-165
A Population-Based Local Search for Solving a Bi-objective Vehicle Routing Problem….Pages 166-175
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem….Pages 176-187
Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling….Pages 188-197
An Analysis of Problem Difficulty for a Class of Optimisation Heuristics….Pages 198-209
A New Grouping Genetic Algorithm for the Quadratic Multiple Knapsack Problem….Pages 210-218
A Hybrid Method for Solving Large-Scale Supply Chain Problems….Pages 219-228
Crossover Operators for the Car Sequencing Problem….Pages 229-239
Back Matter….Pages –