Evolutionary Computation in Combinatorial Optimization: 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004. Proceedings

Adnan Acan (auth.), Jens Gottlieb, Günther R. Raidl (eds.)3540213678, 9783540213673, 9783540246527

This book constitutes the refereed proceedings for the 4th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2004, held in Coimbra, Portugal, in April together with EuroGP 2004 and six workshops on evolutionary computing.

The 23 revised full papers presented were carefully reviewed and selected from 86 submissions. Among the topics addressed are evolutionary algorithms as well as metaheuristics like memetic algorithms, ant colony optimization, and scatter search; the papers are dealing with representations, operators, search spaces, adaptation, comparison of algorithms, hybridization of different methods, and theory. Among the combinatorial optimization problems studied are graph coloring, network design, cutting, packing, scheduling, timetabling, traveling salesman, vehicle routing, and various other real-world applications.

---

Table of contents :
Front Matter….Pages –
Mutation Multiplicity in a Panmictic Two-Strategy Genetic Algorithm….Pages 1-10
Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms….Pages 11-20
Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem….Pages 21-30
A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem….Pages 31-40
AntPacking – An Ant Colony Optimization Approach for the One-Dimensional Bin Packing Problem….Pages 41-50
Scatter Search and Memetic Approaches to the Error Correcting Code Problem….Pages 51-61
A Hybrid Evolutionary Algorithm for Solving the Register Allocation Problem….Pages 62-71
Parallel Ant Systems for the Capacitated Vehicle Routing Problem….Pages 72-83
A Hierarchical Social Metaheuristic for the Max-Cut Problem….Pages 84-94
On the Structure of Sequential Search: Beyond “No Free Lunch”….Pages 95-103
Dealing with Solution Diversity in an EA for Multiple Objective Decision Support – A Case Study….Pages 104-113
A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems….Pages 114-123
Binary Merge Model Representation of the Graph Colouring Problem….Pages 124-134
Hardness Prediction for the University Course Timetabling Problem….Pages 135-144
Hybrid Estimation of Distribution Algorithm for Multiobjective Knapsack Problem….Pages 145-154
On the Use of Path Relinking for the ρ – Hub Median Problem….Pages 155-164
Solving a Real-World Glass Cutting Problem….Pages 165-176
Designing Reliable Communication Networks with a Genetic Algorithm Using a Repair Heuristic….Pages 177-187
Improving Vehicle Routing Using a Customer Waiting Time Colony….Pages 188-198
New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms….Pages 199-209
Improving Edge Recombination through Alternate Inheritance and Greedy Manner….Pages 210-219
Clustering Nominal and Numerical Data: A New Distance Concept for a Hybrid Genetic Algorithm….Pages 220-229
On Search Space Symmetry in Partitioning Problems….Pages 230-240
Back Matter….Pages –