This book constitutes the refereed proceedings of three workshops on the application of evolutionary programming and algorithms in various domains; these workshops were held in conjunction with the 5th European Conference on Genetic Programming, EuroGP 2002, in Kinsale, Ireland, in April 2002.
The 33 revised full papers presented were carefully reviewed and selected by the respective program committees. In accordance with the three workshops EvoCOP, EvoIASP, and EvoSTIM/EvoPLAN, the papers are organized in topical sections on combinatorial optimization problems; image analysis and signal processing; and scheduling, timetabling, and AI planning.
Author(s): Peter Cowling, Graham Kendall, Eric Soubeiga (auth.), Stefano Cagnoni, Jens Gottlieb, Emma Hart, Martin Middendorf, Günther R. Raidl (eds.)
Series: Lecture Notes in Computer Science 2279
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2002
Language: English
Pages: 346
Tags: Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Programming Techniques; Artificial Intelligence (incl. Robotics); Image Processing and Computer Vision; Pattern Recognition
Hyperheuristics: A Tool for Rapid Prototyping in Scheduling and Optimisation....Pages 1-10
SavingsAnts for the Vehicle Routing Problem....Pages 11-20
Updating ACO Pheromones Using Stochastic Gradient Ascent and Cross-Entropy Methods....Pages 21-30
Non-parametric Estimation of Properties of Combinatorial Landscapes....Pages 31-40
Performance of Evolutionary Approaches for Parallel Task Scheduling under Different Representations....Pages 41-50
A Performance Comparison of Alternative Heuristics for the Flow Shop Scheduling Problem....Pages 51-60
Exploiting Fitness Distance Correlation of Set Covering Problems....Pages 61-71
A Population Based Approach for ACO....Pages 72-81
Comparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation....Pages 82-91
Application of Genetic Algorithms in Nanoscience: Cluster Geometry Optimization....Pages 92-101
A Memetic Algorithm for Vertex-Biconnectivity Augmentation....Pages 102-111
Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem....Pages 112-121
An Experimental Investigation of Iterated Local Search for Coloring Graphs....Pages 122-131
Solving Car Sequencing Problems by Local Optimization....Pages 132-142
Evolution Strategies, Network Random Keys, and the One-Max Tree Problem....Pages 143-152
Evolutionary Computational Approaches to Solving the Multiple Traveling Salesman Problem Using a Neighborhood Attractor Schema....Pages 153-162
Boosting ACO with a Preprocessing Step....Pages 163-172
A Memetic Algorithm Guided by Quicksort for the Error-Correcting Graph Isomorphism Problem....Pages 173-182
Evolutionary Techniques for Minimizing Test Signals Application Time....Pages 183-189
Prediction and Modelling of the Flow of a Typical Urban Basin through Genetic Programming....Pages 190-201
Using EAs for Error Prediction in Near Infrared Spectroscopy....Pages 202-209
The Prediction of Journey Times on Motorways Using Genetic Programming....Pages 210-221
The Boru Data Crawler for Object Detection Tasks in Machine Vision....Pages 222-232
Surface Profile Reconstruction from Scattered Intensity Data Using Evolutionary Strategies....Pages 233-244
Detection of Incidents on Motorways in Low Flow High Speed Conditions by Genetic Programming....Pages 245-254
Image Filter Design with Evolvable Hardware....Pages 255-266
A Dynamic Fitness Function Applied to Improve the Generalisation when Evolving a Signal Processing Hardware Architecture....Pages 267-279
Efficiently Computable Fitness Functions for Binary Image Evolution....Pages 280-291
Evolutionary Based Autocalibration from the Fundamental Matrix....Pages 292-303
Medical Image Registration Using Parallel Genetic Algorithms....Pages 304-314
Disruption Management for an Airline — Rescheduling of Aircraft....Pages 315-324
Ant Colony Optimization with the Relative Pheromone Evaluation Method....Pages 325-333
Improving Street Based Routing Using Building Block Mutations....Pages 334-341
