Skip to main content
SpringerLink
Log in

Evolutionary Computation in Combinatorial Optimization

9th European Conference, EvoCOP 2009, Tübingen, Germany, April 15-17, 2009, Proceedings

  • Conference proceedings
  • © 2009

Overview

Editors:
  1. Carlos Cotta

    1. Dept. Lenguajes y Ciencias de la Computación, ETSI Informática, Universidad de Málaga, Málaga, Spain

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Peter Cowling

    1. Department of Computing, University of Bradford, Bradford, UK

    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 5482)

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

Included in the following conference series:

Conference proceedings info: EvoCOP 2009.

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

About this book

This book constitutes the refereed proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2009, held in Tübingen, Germany, in April 2009. The 21 revised full papers presented were carefully reviewed and selected from 53 submissions. The papers present the latest research and discuss current developments and applications in metaheuristics - a paradigm to effectively solve difficult combinatorial optimization problems appearing in various industrial, economical, and scientific 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.

Similar content being viewed by others

Keywords

Table of contents (21 papers)

  1. Front Matter

    Download chapter PDF

  2. A Critical Element-Guided Perturbation Strategy for Iterated Local Search

    • Zhipeng Lü, Jin-Kao Hao
    Pages 1-12

  3. A Genetic Algorithm for Net Present Value Maximization for Resource Constrained Projects

    • Mario Vanhoucke
    Pages 13-24

  4. A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse

    • Matthias Prandtstetter, Günther R. Raidl, Thomas Misar
    Pages 25-36

  5. A New Binary Description of the Blocks Relocation Problem and Benefits in a Look Ahead Heuristic

    • Marco Caserta, Silvia Schwarze, Stefan Voß
    Pages 37-48

  6. A Plasmid Based Transgenetic Algorithm for the Biobjective Minimum Spanning Tree Problem

    • Sílvia M. D. Monteiro, Elizabeth F. G. Goldbarg, Marco C. Goldbarg
    Pages 49-60

  7. A Tabu Search Algorithm with Direct Representation for Strip Packing

    • Jean-Philippe Hamiez, Julien Robet, Jin-Kao Hao
    Pages 61-72

  8. An ACO Approach to Planning

    • Marco Baioletti, Alfredo Milani, Valentina Poggioni, Fabio Rossi
    Pages 73-84

  9. An Artificial Immune System for the Multi-Mode Resource-Constrained Project Scheduling Problem

    • Vincent Van Peteghem, Mario Vanhoucke
    Pages 85-96

  10. Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows

    • Manuel López-Ibáñez, Christian Blum, Dhananjay Thiruvady, Andreas T. Ernst, Bernd Meyer
    Pages 97-108

  11. Binary Exponential Back Off for Tabu Tenure in Hyperheuristics

    • Stephen Remde, Keshav Dahal, Peter Cowling, Nic Colledge
    Pages 109-120

  12. Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms

    • Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
    Pages 121-132

  13. Divide-And-Evolve Facing State-of-the-Art Temporal Planners during the 6th International Planning Competition

    • Jacques Bibai, Marc Schoenauer, Pierre Savéant
    Pages 133-144

  14. Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm

    • Madeleine Theile
    Pages 145-155

  15. Finding Balanced Incomplete Block Designs with Metaheuristics

    • David Rodríguez Rueda, Carlos Cotta, Antonio J. Fernández
    Pages 156-167

  16. Guided Ejection Search for the Job Shop Scheduling Problem

    • Yuichi Nagata, Satoshi Tojo
    Pages 168-179

  17. Improving Performance in Combinatorial Optimisation Using Averaging and Clustering

    • Mohamed Qasem, Adam Prügel-Bennett
    Pages 180-191

  18. Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks

    • Steffen Wolf, Peter Merz
    Pages 192-203

  19. Metropolis and Symmetric Functions: A Swan Song

    • Lars Kaden, Nicole Weicker, Karsten Weicker
    Pages 204-215

  20. Robustness Analysis in Evolutionary Multi-Objective Optimization Applied to VAR Planning in Electrical Distribution Networks

    • Carlos Barrico, Carlos Henggeler Antunes, Dulce Fernão Pires
    Pages 216-227
Back to top

Other volumes

  1. Evolutionary Computation in Combinatorial Optimization

Editors and Affiliations

  • Dept. Lenguajes y Ciencias de la Computación, ETSI Informática, Universidad de Málaga, Málaga, Spain

    Carlos Cotta

  • Department of Computing, University of Bradford, Bradford, UK

    Peter Cowling

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation