Skip to main content
SpringerLink
Log in

Evolutionary Computation in Combinatorial Optimization

6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Jens Gottlieb

    1. SAP AG, Walldorf, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Günther R. Raidl

    1. Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3906)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: EvoCOP 2006.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (24 papers)

  1. Front Matter

    Download chapter PDF

  2. Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem

    • Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin
    Pages 1-12

  3. The Trade Off Between Diversity and Quality for Multi-objective Workforce Scheduling

    • Peter Cowling, Nic Colledge, Keshav Dahal, Stephen Remde
    Pages 13-24

  4. Evolving the Structure of the Particle Swarm Optimization Algorithms

    • Laura Dioşan, Mihai Oltean
    Pages 25-36

  5. A Tabu Search Algorithm for Optimization of Gas Distribution Networks

    • Herbert de Mélo Duarte, Elizabeth F. Gouvêa Goldbarg, Marco César Goldbarg
    Pages 37-48

  6. 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
    Pages 49-60

  7. Parametrized GRASP Heuristics for Three-Index Assignment

    • Armin Fügenschuh, Benjamin Höfler
    Pages 61-72

  8. A Memetic Algorithm with Bucket Elimination for the Still Life Problem

    • José E. Gallardo, Carlos Cotta, Antonio J. Fernández
    Pages 73-85

  9. Effects of Scale-Free and Small-World Topologies on Binary Coded Self-adaptive CEA

    • Mario Giacobini, Mike Preuss, Marco Tomassini
    Pages 86-98

  10. Particle Swarm for the Traveling Salesman Problem

    • Elizabeth F. Gouvêa Goldbarg, Givanaldo R. de Souza, Marco César Goldbarg
    Pages 99-110

  11. Hierarchical Cellular Genetic Algorithm

    • Stefan Janson, Enrique Alba, Bernabé Dorronsoro, Martin Middendorf
    Pages 111-122

  12. Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation

    • István Juhos, Jano I. van Hemert
    Pages 123-134

  13. Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes: A Hybrid Genetic Approach

    • Ali Husseinzadeh Kashan, Behrooz Karimi, Fariborz Jolai
    Pages 135-146

  14. A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems

    • Britta Kehden, Frank Neumann
    Pages 147-158

  15. New Computational Results for the Nurse Scheduling Problem: A Scatter Search Algorithm

    • Broos Maenhout, Mario Vanhoucke
    Pages 159-170

  16. Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems

    • Yuichi Nagata
    Pages 171-182

  17. A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem

    • Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo
    Pages 183-194

  18. The Core Concept for the Multidimensional Knapsack Problem

    • Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy
    Pages 195-208

  19. Multiobjective Scheduling of Jobs with Incompatible Families on Parallel Batch Machines

    • Dirk Reichelt, Lars Mönch
    Pages 209-221

  20. A Memetic Algorithm for the Biobjective Minimum Spanning Tree Problem

    • Daniel A. M. Rocha, Elizabeth F. Gouvêa Goldbarg, Marco César Goldbarg
    Pages 222-233
Back to top

Other volumes

  1. Evolutionary Computation in Combinatorial Optimization

Editors and Affiliations

  • SAP AG, Walldorf, Germany

    Jens Gottlieb

  • Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria

    Günther R. Raidl

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation