Hybrid Metaheuristics: 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the 7th International Workshop on Hybrid Metaheuristics, HM 2010, held in Vienna, Austria, in October 2010. The 14 revised full papers presented were carefully reviewed and selected from 29 submissions.

Author(s): Manuel Lozano, Christian Blum (auth.), María J. Blesa, Christian Blum, Günther Raidl, Andrea Roli, Michael Sampels (eds.)
Series: Lecture Notes in Computer Science 6373 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010

Language: English
Pages: 223
Tags: Software Engineering; Algorithm Analysis and Problem Complexity; Computation by Abstract Devices; Logics and Meanings of Programs; Programming Languages, Compilers, Interpreters; Programming Techniques

Front Matter....Pages -
A Hybrid Metaheuristic for the Longest Common Subsequence Problem....Pages 1-15
Hybrid Algorithms for the Variable Sized Bin Packing Problem....Pages 16-30
A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model....Pages 31-45
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem....Pages 46-61
A New Approach for Solving the Generalized Traveling Salesman Problem....Pages 62-72
Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem....Pages 73-87
A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem....Pages 88-102
A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents....Pages 103-117
New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem....Pages 118-132
An Improved Memetic Algorithm for Break Scheduling....Pages 133-147
Consultant-Guided Search Algorithms for the Quadratic Assignment Problem....Pages 148-159
On Index Structures in Hybrid Metaheuristics for Routing Problems with Hard Feasibility Checks: An Application to the 2-Dimensional Loading Vehicle Routing Problem....Pages 160-173
Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem....Pages 174-189
SearchCol: Metaheuristic Search by Column Generation....Pages 190-205
Survey: Matheuristics for Rich Vehicle Routing Problems....Pages 206-221
Back Matter....Pages -