product iamge

Evolutionary Computation in Combinatorial Optimization: 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Adnan Acan (auth.), Günther R. Raidl, Jens Gottlieb (eds.)
Series: Lecture Notes in Computer Science 3448 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2005

Language: English
Pages: 271
Tags: Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Numeric Computing; Discrete Mathematics in Computer Science

Front Matter....Pages -
An External Partial Permutations Memory for Ant Colony Optimization....Pages 1-11
A Novel Application of Evolutionary Computing in Process Systems Engineering....Pages 12-22
Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework....Pages 23-33
An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem....Pages 34-45
EvoGeneS , a New Evolutionary Approach to Graph Generation....Pages 46-57
On the Application of Evolutionary Algorithms to the Consensus Tree Problem....Pages 58-67
Analyzing Fitness Landscapes for the Optimal Golomb Ruler Problem....Pages 68-79
Immune Algorithms with Aging Operators for the String Folding Problem and the Protein Folding Problem....Pages 80-90
Multiobjective Quadratic Assignment Problem Solved by an Explicit Building Block Search Algorithm – MOMGA-IIa....Pages 91-100
Lot-Sizing in a Foundry Using Genetic Algorithm and Repair Functions....Pages 101-111
Estimation of Distribution Algorithms with Mutation....Pages 112-121
Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution....Pages 122-131
Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring....Pages 132-143
Application of the Grouping Genetic Algorithm to University Course Timetabling....Pages 144-153
Self-Adapting Evolutionary Parameters: Encoding Aspects for Combinatorial Optimization Problems....Pages 154-165
Population Training Heuristics....Pages 166-176
Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem....Pages 177-189
The Use of Meta-heuristics to Solve Economic Lot Scheduling Problem....Pages 190-201
Making the Edge-Set Encoding Fly by Controlling the Bias of Its Crossover Operator....Pages 202-212
Ant Algorithm for the Graph Matching Problem....Pages 213-223
An Adaptive Genetic Algorithm for the Minimal Switching Graph Problem....Pages 224-233
An Improved Simulated Annealing Method for the Combinatorial Sub-problem of the Profit-Based Unit Commitment Problem....Pages 234-245
A New Hybrid GA/SA Algorithm for the Job Shop Scheduling Problem....Pages 246-259
An Agent Model for Binary Constraint Satisfaction Problems....Pages 260-269
Back Matter....Pages -