Evolutionary Computation in Combinatorial Optimization: 6th European Conference, Evocop 2006, Budapest, Hungary, April 10-12, 2006, Proceedings by Jens GottliebEvolutionary Computation in Combinatorial Optimization: 6th European Conference, Evocop 2006, Budapest, Hungary, April 10-12, 2006, Proceedings by Jens Gottlieb

Evolutionary Computation in Combinatorial Optimization: 6th European Conference, Evocop 2006…

byJens GottliebEditorGünther R. Raidl, Gnther R. Raidl

Paperback | March 24, 2006

Pricing and Purchase Info

$114.32 online 
$136.95 list price save 16%
Earn 572 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the refereed proceedings of the 6th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2006, held in Budapest, Hungary in April 2006. The 24 revised full papers presented were carefully reviewed and selected from 77 submissions. The papers include coverage of evolutionary algorithms as well as various other metaheuristics, like scatter search, tabu search, and memetic algorithms.

Title:Evolutionary Computation in Combinatorial Optimization: 6th European Conference, Evocop 2006…Format:PaperbackDimensions:296 pages, 23.5 × 15.5 × 0.07 inPublished:March 24, 2006Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540331786

ISBN - 13:9783540331780

Look for similar items by category:

Reviews

Table of Contents

Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem.- The Trade Off Between Diversity and Quality for Multi-objective Workforce Scheduling.- Evolving the Structure of the Particle Swarm Optimization Algorithms.- A Tabu Search Algorithm for Optimization of Gas Distribution Networks.- Design of a Retail Chain Stocking Up Policy with a Hybrid Evolutionary Algorithm.- Parametrized GRASP Heuristics for Three-Index Assignment.- A Memetic Algorithm with Bucket Elimination for the Still Life Problem.- Effects of Scale-Free and Small-World Topologies on Binary Coded Self-adaptive CEA.- Particle Swarm for the Traveling Salesman Problem.- Hierarchical Cellular Genetic Algorithm.- Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation.- Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes: A Hybrid Genetic Approach.- A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems.- New Computational Results for the Nurse Scheduling Problem: A Scatter Search Algorithm.- Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems.- A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem.- The Core Concept for the Multidimensional Knapsack Problem.- Multiobjective Scheduling of Jobs with Incompatible Families on Parallel Batch Machines.- A Memetic Algorithm for the Biobjective Minimum Spanning Tree Problem.- A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems.- Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning.- A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems.- An Efficient Hybrid Search Algorithm for Various Optimization Problems.- A Hybrid VNS/Tabu Search Algorithm for Apportioning the European Parliament.