Skip to main content
  • Conference proceedings
  • © 2010

Hybrid Metaheuristics

7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010, Proceedings

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

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

Conference series link(s): HM: International Workshop on Hybrid Metaheuristics

Conference proceedings info: HM 2010.

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (15 papers)

  1. Front Matter

  2. Hybrid Algorithms for the Variable Sized Bin Packing Problem

    • Christian Blum, Vera Hemmelmayr, Hugo Hernández, Verena Schmid
    Pages 16-30
  3. A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model

    • Hande Küçükaydın, Necati Aras, İ. Kuban Altınel
    Pages 31-45
  4. A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem

    • Luca Di Gaspero, Johannes Gärtner, Nysret Musliu, Andrea Schaerf, Werner Schafhauser, Wolfgang Slany
    Pages 46-61
  5. Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem

    • André Renato Villela da Silva, Luiz Satoru Ochi
    Pages 73-87
  6. A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem

    • Viet-Phuong Nguyen, Christian Prins, Caroline Prodhon
    Pages 88-102
  7. A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents

    • Christian Schauer, Matthias Prandtstetter, Günther R. Raidl
    Pages 103-117
  8. New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem

    • Saïd Hanafi, Jasmina Lazić, Nenad Mladenović, Christophe Wilbaut, Igor Crévits
    Pages 118-132
  9. An Improved Memetic Algorithm for Break Scheduling

    • Magdalena Widl, Nysret Musliu
    Pages 133-147
  10. SearchCol: Metaheuristic Search by Column Generation

    • Filipe Alvelos, Amaro de Sousa, Dorabella Santos
    Pages 190-205
  11. Survey: Matheuristics for Rich Vehicle Routing Problems

    • Karl F. Doerner, Verena Schmid
    Pages 206-221
  12. Back Matter

Other Volumes

  1. Hybrid Metaheuristics

Keywords

  • Scheduling
  • algorithms
  • bioinformatics
  • co-operative search
  • design
  • empirical comparison
  • expert systems
  • metaheuristic
  • metaheuristics
  • parallelization
  • parameter tuning
  • portfolio techniques
  • programming languages
  • programming techniques
  • statis
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Universitat Politècnica de Catalunya, Barcelona, Spain

    María J. Blesa

  • ALBCOM Research Group, Universitat Politècnica de Catalunya, Barcelona, Spain

    Christian Blum

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

    Günther Raidl

  • Università di Bologna, Sede di Cesena, Cesena, Italy

    Andrea Roli

  • Université Libre de Bruxelles, Bruxelles, Belgium

    Michael Sampels

Bibliographic Information

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions