did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

We're the #1 textbook rental company. Let us show you why.

9783540331780

Evolutionary Computation in Combinatorial Optimization : 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings

by ; ;
  • ISBN13:

    9783540331780

  • ISBN10:

    3540331786

  • Format: Paperback
  • Copyright: 2006-04-15
  • Publisher: Springer Verlag
  • Purchase Benefits
List Price: $99.00 Save up to $80.44
  • Digital
    $40.22
    Add to Cart

    DURATION
    PRICE

Supplemental Materials

What is included with this book?

Summary

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 cover evolutionary algorithms as well as various other metaheuristics, like scatter search, tabu search, memetic algorithms, variable neighborhood search, greedy randomized adaptive search procedures, ant colony optimization, and particle swarm optimization algorithms. The papers deal with representations, heuristics, analysis of problem structures, and comparisons of algorithms. The list of studied combinatorial optimization problems includes prominent examples like graph coloring, knapsack problems, the traveling salesperson problem, scheduling, graph matching, as well as specific real-world problems.

Table of Contents

Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem
Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin
1(12)
The Trade Off Between Diversity and Quality for Multi-objective Workforce Scheduling
Peter Cowling, Nic Colledge, Keshav Dahal, Stephen Remde
13(12)
Evolving the Structure of the Particle Swarm Optimization Algorithms
Laura Diosan, Mihai Oltean
25(12)
A Tabu Search Algorithm for Optimization of Gas Distribution Networks
Herbert de Mélo Duarte, Elizabeth F. Gouvêa Goldbarg, Marco César Goldbarg
37(12)
Design of a Retail Chain Stocking Up Policy with a Hybrid Evolutionary Algorithm
Anna I. Esparcia-Alcázar, Lidia Lluch-Revert, Manuel Cardós, Ken Sharman, Carlos Andrés-Romano
49(12)
Parametrized GRASP Heuristics for Three-Index Assignment
Armin Fügenschuh, Benjamin Höfler
61(12)
A Memetic Algorithm with Bucket Elimination for the Still Life Problem
José E. Gallardo, Carlos Cotta, Antonio J. Fernández
73(13)
Effects of Scale-Free and Small-World Topologies on Binary Coded Self-adaptive CEA
Mario Giacobini, Mike Preuss, Marco Tomassini
86(13)
Particle Swarm for the Traveling Salesman Problem
Elizabeth F. Gouvêa Goldbarg, Givanaldo R. de Souza, Marco César Goldbarg
99(12)
Hierarchical Cellular Genetic Algorithm
Stefan Janson, Enrique Alba, Bernabé Dorronsoro, Martin Middendorf
111(12)
Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation
István Juhos, Jano I. van Hemert
123(12)
Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes: A Hybrid Genetic Approach
Ali Husseinzadeh Kashan, Behrooz Karimi, Fariborz Jolai
135(12)
A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems
Britta Kehden, Frank Neumann
147(12)
New Computational Results for the Nurse Scheduling Problem: A Scatter Search Algorithm
Broos Maenhout, Mario Vanhoucke
159(12)
Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems
Yuichi Nagata
171(12)
A Memetic Algorithm with Population Management (MA/PM) for the Capacitated Location-Routing Problem
Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo
183(12)
The Core Concept for the Multidimensional Knapsack Problem
Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy
195(14)
Multiobjective Scheduling of Jobs with Incompatible Families on Parallel Batch Machines
Dirk Reichelt, Lars Mönch
209(13)
A Memetic Algorithm for the Biobjective Minimum Spanning Tree Problem
Daniel A.M. Rocha, Elizabeth F. Gouvêa Goldbarg, Marco César Goldbarg
222(12)
A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems
Olfa Sammoud, Sébastien Sorlin, Christine Solnon, Khaled Ghédira
234(13)
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
Marc Schoenauer, Pierre Savéant, Vincent Vidal
247(14)
A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems
Mehmet Sevkli, M. Emin Aydin
261(11)
An Efficient Hybrid Search Algorithm for Various Optimization Problems
Mario Vanhoucke
272(12)
A Hybrid VNS/Tabu Search Algorithm for Apportioning the European Parliament
Gabriel Villa, Sebastián Lozano, Jesús Racero, David Canca
284(9)
Author Index 293

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program