Evolutionary Computation in Combinatorial Optimization(组合优化中的进化计算/会议录)

This book constitutes the refereed proceedings of the 5th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2005, held in Lausanne, Switzerland in March/April 2005.
The 24 revised full papers presented were carefully reviewed and selected from 66 submissions. The papers cover evolutionary algorithms as well as related approaches like scatter search, simulated annealing, ant colony optimization, immune algorithms, variable neighborhood search, hyperheuristics, and estimation of distribution algorithms. The papers deal with representations, analysis of operators and fitness landscapes, and comparison algorithms. Among the combinatorial optimization problems studied are graph coloring, quadratic assignment, knapsack, graph matching, packing, scheduling, timetabling, lot-sizing, and the traveling salesman problem.

An External Partial Permutations Memory for Ant Colony Optimization
A Novel Application of Evolutionary Computing in Process Systems Engineering
Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework
An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem
EvoGeneS, a New Evolutionary Approach to Graph Generation
On the Application of Evolutionary Algorithms to the Consensus Tree Problem
Analyzing Fitness Landscapes for the Optimal Golomb Ruler Problem
Immune Algorithms with Aging Operators for the String Folding Problem and the Protein Folding Problem
Multiobjective Quadratic Assignment Problem Solved by an Explicit Building Block Search Algorithm - MOMGA-IIa
Lot-Sizing in a Foundry Using Genetic Algorithm and Repair Functions
Estimation of Distribution Algorithms with Mutation
Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution
Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring
Application of the Grouping Genetic Algorithm to University Course Timetabling
Self-Adapting Evolutionary Parameters: Encoding Aspects for Combinatorial Optimization Problems
Population Training Heuristics
Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem
The Use of Meta-heuristics to Solve Economic Lot Scheduling Problem
Making the Edge-Set Encoding Fly by Controlling the Bias of Its Crossover Operator
Ant Algorithm for the Graph Matching Problem
An Adaptive Genetic Algorithm for the Minimal Switching Graph Problem
An Improved Simulated Annealing Method for the Combinatorial Sub-problem of the Profit-Based Unit Commitment Problem
……
Author Index