Evolutionary Computation in Combinatorial Optimization: 6th European Conference,

The Nile on
Evolutionary Computation in Combinatorial Optimization by Jens Gottlieb, Günther R. Raidl

Constitutes the refereed proceedings of the 6th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2006, held in Budapest, Hungary in April 2006. This book features the papers that cover evolutionary algorithms as well as various other metaheuristics, like scatter search, tabu search, and memetic algorithms.

FORMAT
Paperback LANGUAGE
English CONDITION
Brand New Publisher Description

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.

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.

Long Description

Metaheuristics have often been shown to be e'ective for di'cult combinatorial optimization problems appearing in various industrial, economical, and scienti'c domains. Prominent examples of metaheuristics are evolutionary algorithms, simulated annealing, tabu search, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms, and ant colony optimization. Successfully solved problems include scheduling, timetabling, network design, transportation and distribution problems, vehicle routing, the traveling sal- person problem, satis'ability, packing and cutting problems, planning problems, and general mixed integer programming. The EvoCOP event series started in 2001 and has been held annually since then. It was the ?rst speci'cally dedicated to the application of evolutionary computation and related methods to combinatorial optimization problems. E- lutionary computation involves the study of problem-solving and optimization techniques inspired by principles of natural evolution and genetics. Following the general trend of hybrid metaheuristics and diminishing boundaries between the di'erent classes of metaheuristics, EvoCOP has broadened its scope over the optimization problems.

Details ISBN3540331786 Short Title EVOLUTIONARY COMPUTATION IN CO Language English ISBN-10 3540331786 ISBN-13 9783540331780 Media Book Format Paperback Series Number 3906 Year 2006 Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. K Place of Publication Berlin Country of Publication Germany Pages 296 Edition 2006th Subtitle 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings DOI 10.1604/9783540331780;10.1007/11730095 Author Günther R. Raidl Publisher Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Edition Description 2006 ed. Publication Date 2006-03-24 Edited by Günther R. Raidl DEWEY 006.333 Illustrations XII, 296 p. Audience Professional & Vocational Country of Origin US Product Class Description Mathematics Series Lecture Notes in Computer Science Alternative 9783540331797
We\'ve got this

At The Nile, if you\'re looking for it, we\'ve got it.
With fast shipping, low prices, friendly service and well over a million items - you\'re bound to find what you want, at a price you\'ll love!

TheNile_Item_ID:96285182;