Evolutionary Computation in Combinatorial Optimization : 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004, Proceedings / edited by Jens Gottlieb, Günther R. Raidl.

Format:

Book

Contributor:

Gottlieb, Jens, editor.

Raidl, Günther R., editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

Lecture notes in computer science 0302-9743 ; 3004.

Lecture Notes in Computer Science, 0302-9743 ; 3004

Language:

English

Subjects (All):

Mathematical optimization.

Computers.

Algorithms.

Numerical analysis.

Computer science--Mathematics.

Computer science.

Combinatorial analysis.

Optimization.

Computation by Abstract Devices.

Algorithm Analysis and Problem Complexity.

Numeric Computing.

Discrete Mathematics in Computer Science.

Combinatorics.

Local Subjects:

Optimization.

Computation by Abstract Devices.

Algorithm Analysis and Problem Complexity.

Numeric Computing.

Discrete Mathematics in Computer Science.

Combinatorics.

Physical Description:

1 online resource (X, 240 pages).

Edition:

First edition 2004.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.

System Details:

text file PDF

Summary:

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.

Contents:

EvoCOP Contributions

Mutation Multiplicity in a Panmictic Two-Strategy Genetic Algorithm

Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms

Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem

A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem

AntPacking - An Ant Colony Optimization Approach for the One-Dimensional Bin Packing Problem

Scatter Search and Memetic Approaches to the Error Correcting Code Problem

A Hybrid Evolutionary Algorithm for Solving the Register Allocation Problem

Parallel Ant Systems for the Capacitated Vehicle Routing Problem

A Hierarchical Social Metaheuristic for the Max-Cut Problem

On the Structure of Sequential Search: Beyond "No Free Lunch"

Dealing with Solution Diversity in an EA for Multiple Objective Decision Support - A Case Study

A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems

Binary Merge Model Representation of the Graph Colouring Problem

Hardness Prediction for the University Course Timetabling Problem

Hybrid Estimation of Distribution Algorithm for Multiobjective Knapsack Problem

On the Use of Path Relinking for the ? - Hub Median Problem

Solving a Real-World Glass Cutting Problem

Designing Reliable Communication Networks with a Genetic Algorithm Using a Repair Heuristic

Improving Vehicle Routing Using a Customer Waiting Time Colony

New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms

Improving Edge Recombination through Alternate Inheritance and Greedy Manner

Clustering Nominal and Numerical Data: A New Distance Concept for a Hybrid Genetic Algorithm

On Search Space Symmetry in Partitioning Problems.

Other Format:

Printed edition:

ISBN:

978-3-540-24652-7

9783540246527

Access Restriction:

Restricted for use by site license.