Skip to main content
SpringerLink
Log in

Evolutionary Computation in Combinatorial Optimization

8th European Conference, EvoCOP 2008, Naples, Italy, March 26-28, 2008, Proceedings

  • Conference proceedings
  • © 2008

Overview

Editors:
  1. Jano Hemert
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Carlos Cotta
    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 4972)

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

Included in the following conference series:

Conference proceedings info: EvoCOP 2008.

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. Adaptive Tabu Tenure Computation in Local Search

    • Isabelle Devarenne, Hakim Mabed, Alexandre Caminada
    Pages 1-12

  3. A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems

    • Bart G. W. Craenen, Ben Paechter
    Pages 13-24

  4. Cooperative Particle Swarm Optimization for the Delay Constrained Least Cost Path Problem

    • Ammar W. Mohemmed, Mengjie Zhang, Nirod Chandra Sahoo
    Pages 25-35

  5. Effective Neighborhood Structures for the Generalized Traveling Salesman Problem

    • Bin Hu, Günther R. Raidl
    Pages 36-47

  6. Efficient Local Search Limitation Strategies for Vehicle Routing Problems

    • Yuichi Nagata, Olli Bräysy
    Pages 48-60

  7. Evolutionary Local Search for the Minimum Energy Broadcast Problem

    • Steffen Wolf, Peter Merz
    Pages 61-72

  8. Exploring Multi-objective PSO and GRASP-PR for Rule Induction

    • Celso Y. Ishida, Andre B. de Carvalho, Aurora T. R. Pozo, Elizabeth F. G. Goldbarg, Marco C. Goldbarg
    Pages 73-84

  9. An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem

    • Christian Blum, Joaquín Bautista, Jordi Pereira
    Pages 85-96

  10. Graph Colouring Heuristics Guided by Higher Order Graph Properties

    • István Juhos, Jano van Hemert
    Pages 97-109

  11. A Hybrid Column Generation Approach for the Berth Allocation Problem

    • Geraldo R. Mauri, Alexandre C. M. Oliveira, Luiz Antonio Nogueira Lorena
    Pages 110-122

  12. Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem

    • Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena
    Pages 123-134

  13. An ILS Based Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Limit

    • Anand Subramanian, Lucídio dos Anjos Formiga Cabral
    Pages 135-146

  14. An Immune Genetic Algorithm Based on Bottleneck Jobs for the Job Shop Scheduling Problem

    • Rui Zhang, Cheng Wu
    Pages 147-157

  15. Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem

    • Kerstin Bauer, Thomas Fischer, Sven O. Krumke, Katharina Gerhardt, Stephan Westphal, Peter Merz
    Pages 158-169

  16. Improving Metaheuristic Performance by Evolving a Variable Fitness Function

    • Keshav Dahal, Stephen Remde, Peter Cowling, Nic Colledge
    Pages 170-181

  17. Improving Query Expansion with Stemming Terms: A New Genetic Algorithm Approach

    • Lourdes Araujo, José R. Pérez-Agüera
    Pages 182-193

  18. Inc*: An Incremental Approach for Improving Local Search Heuristics

    • Mohamed Bader-El-Den, Riccardo Poli
    Pages 194-205

  19. Metaheuristics for the Bi-objective Ring Star Problem

    • Arnaud Liefooghe, Laetitia Jourdan, Matthieu Basseur, El-Ghazali Talbi, Edmund K. Burke
    Pages 206-217

  20. Multiobjective Prototype Optimization with Evolved Improvement Steps

    • Jiri Kubalik, Richard Mordinyi, Stefan Biffl
    Pages 218-229
Back to top

Other volumes

  1. Evolutionary Computation in Combinatorial Optimization

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation