Skip to main content
  • Conference proceedings
  • © 2011

Evolutionary Computation in Combinatorial Optimization

11th European Conference, EvoCOP 2011, Torino, Italy, April 27-29, 2011, Proceedings

  • State-of-the-art research
  • Fast-track conference proceedings
  • Unique visibility

Conference proceedings info: EvoCOP 2011.

Buy it now

Buying options

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

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

Table of contents (22 papers)

  1. Front Matter

  2. A Kolmogorov-Type Stability Measure for Evolutionary Algorithms

    • Matthew J. Craven, Henri C. Jimbo
    Pages 26-37
  3. A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem

    • Federico Della Croce, Andrea Grosso, Fabio Salassa
    Pages 38-47
  4. Connectedness and Local Search for Bicriteria Knapsack Problems

    • Arnaud Liefooghe, Luís Paquete, Marco Simões, José R. Figueira
    Pages 48-59
  5. Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming

    • Yang Wang, Zhipeng Lü, Fred Glover, Jin-Kao Hao
    Pages 72-83
  6. Experiments in Parallel Constraint-Based Local Search

    • Yves Caniou, Philippe Codognet, Daniel Diaz, Salvador Abreu
    Pages 96-107
  7. Frequency Distribution Based Hyper-Heuristic for the Bin-Packing Problem

    • He Jiang, Shuyan Zhang, Jifeng Xuan, Youxi Wu
    Pages 118-129
  8. From Adaptive to More Dynamic Control in Evolutionary Algorithms

    • Giacomo di Tollo, Frédéric Lardeux, Jorge Maturana, Frédéric Saubion
    Pages 130-141
  9. Multi-start Heuristics for the Two-Echelon Vehicle Routing Problem

    • Teodor Gabriel Crainic, Simona Mancini, Guido Perboli, Roberto Tadei
    Pages 179-190
  10. NILS: A Neutrality-Based Iterated Local Search and Its Application to Flowshop Scheduling

    • Marie-Eléonore Marmion, Clarisse Dhaenens, Laetitia Jourdan, Arnaud Liefooghe, Sébastien Verel
    Pages 191-202
  11. Off-line and On-line Tuning: A Study on Operator Selection for a Memetic Algorithm Applied to the QAP

    • Gianpiero Francesca, Paola Pellegrini, Thomas Stützle, Mauro Birattari
    Pages 203-214

Other Volumes

  1. Evolutionary Computation in Combinatorial Optimization

About this book

This book constitutes the refereed proceedings of the 11th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2011, held in Torino, Italy, in April 2011. The 22 revised full papers presented were carefully reviewed and selected from 42 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.

Editors and Affiliations

  • Department of Business Administration and Computer Science, University of Applied Sciences and Arts, Hannover, Germany

    Peter Merz

  • Faculty of Sciences, University of Angers, Angers, France

    Jin-Kao Hao

Bibliographic Information

Buy it now

Buying options

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