Skip to main content
SpringerLink
Log in

Evolutionary Computation in Combinatorial Optimization

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

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Peter Merz

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jin-Kao Hao

    1. Faculty of Sciences, University of Angers, Angers, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

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

Included in the following conference series:

Conference proceedings info: EvoCOP 2011.

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

Access this book

Log in via an institution
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

Table of contents (22 papers)

  1. Front Matter

    Download chapter PDF

  2. A Guided Search Non-dominated Sorting Genetic Algorithm for the Multi-Objective University Course Timetabling Problem

    • Sadaf Naseem Jat, Shengxiang Yang
    Pages 1-13

  3. A Hybrid Dual-Population Genetic Algorithm for the Single Machine Maximum Lateness Problem

    • Veronique Sels, Mario Vanhoucke
    Pages 14-25

  4. A Kolmogorov-Type Stability Measure for Evolutionary Algorithms

    • Matthew J. Craven, Henri C. Jimbo
    Pages 26-37

  5. A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem

    • Federico Della Croce, Andrea Grosso, Fabio Salassa
    Pages 38-47

  6. Connectedness and Local Search for Bicriteria Knapsack Problems

    • Arnaud Liefooghe, Luís Paquete, Marco Simões, José R. Figueira
    Pages 48-59

  7. Cutting Graphs Using Competing Ant Colonies and an Edge Clustering Heuristic

    • Max Hinne, Elena Marchiori
    Pages 60-71

  8. Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming

    • Yang Wang, Zhipeng Lü, Fred Glover, Jin-Kao Hao
    Pages 72-83

  9. Evolutionary Multiobjective Route Planning in Dynamic Multi-hop Ridesharing

    • Wesam Herbawi, Michael Weber
    Pages 84-95

  10. Experiments in Parallel Constraint-Based Local Search

    • Yves Caniou, Philippe Codognet, Daniel Diaz, Salvador Abreu
    Pages 96-107

  11. Fitness-Probability Cloud and a Measure of Problem Hardness for Evolutionary Algorithms

    • Guanzhou Lu, Jinlong Li, Xin Yao
    Pages 108-117

  12. Frequency Distribution Based Hyper-Heuristic for the Bin-Packing Problem

    • He Jiang, Shuyan Zhang, Jifeng Xuan, Youxi Wu
    Pages 118-129

  13. 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

  14. Geometric Generalisation of Surrogate Model Based Optimisation to Combinatorial Spaces

    • Alberto Moraglio, Ahmed Kattan
    Pages 142-154

  15. GPU-Based Approaches for Multiobjective Local Search Algorithms. A Case Study: The Flowshop Scheduling Problem

    • Thé Van Luong, Nouredine Melab, El-Ghazali Talbi
    Pages 155-166

  16. Local Search for Mixed-Integer Nonlinear Optimization: A Methodology and an Application

    • Frédéric Gardi, Karim Nouioua
    Pages 167-178

  17. Multi-start Heuristics for the Two-Echelon Vehicle Routing Problem

    • Teodor Gabriel Crainic, Simona Mancini, Guido Perboli, Roberto Tadei
    Pages 179-190

  18. 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

  19. 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

  20. On Complexity of the Optimal Recombination for the Travelling Salesman Problem

    • Anton V. Eremeev
    Pages 215-225
Back to top

Other volumes

  1. Evolutionary Computation in Combinatorial Optimization

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation