Hybrid Metaheuristics: Third International Workshop, HM 2006 Gran Canaria, Spain, October 13-14, 2006 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"

The International Workshop on Hybrid Metaheuristics reached its third edition with HM 2006. The active and successful participation in the past editions was a clear indication that the research community on metaheuristics and related areas felt the need for a forum to discuss speci?c aspects of hybridization of metaheuristics. The selection of papers for HM 2006 consolidated some of the mainstream issues that have emerged from the past editions. Firstly, there are prominent examples of e?ective hybrid techniques whose design and implementation were motivated by challenging real-world applications. We believe this is particularly important for two reasons: on the one hand, researchers are conscious that the primary goal of developing algorithms is to solve relevant real-life problems; on the other hand, the path towarde?cient solving methods for practical problems is a source of new outstanding ideas and theories. A second important issue is that the research community on metaheur- tics has become increasingly interested in and open to techniques and methods known from arti?cial intelligence (AI) and operations research (OR). So far, the most representative examples of such integration have been the use of AI/OR techniques as subordinates of metaheuristic methods. As a historical and - ymological note, this is in perfect accordance with the original meaning of a metaheuristic as a “general strategy controlling a subordinate heuristic. ” The awareness of the need for a sound experimental methodology is a third keypoint.

Author(s): Günther R. Raidl (auth.), Francisco Almeida, María J. Blesa Aguilera, Christian Blum, José Marcos Moreno Vega, Melquíades Pérez Pérez, Andrea Roli, Michael Sampels (eds.)
Series: Lecture Notes in Computer Science 4030 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2006

Language: English
Pages: 193
Tags: Algorithm Analysis and Problem Complexity; Computation by Abstract Devices; Artificial Intelligence (incl. Robotics); Numeric Computing; Pattern Recognition

Front Matter....Pages -
A Unified View on Hybrid Metaheuristics....Pages 1-12
Packing Problems with Soft Rectangles....Pages 13-27
A Multi-population Parallel Genetic Algorithm for Highly Constrained Continuous Galvanizing Line Scheduling....Pages 28-41
Improvement in the Performance of Island Based Genetic Algorithms Through Path Relinking....Pages 42-56
Using Datamining Techniques to Help Metaheuristics: A Short Survey....Pages 57-69
An Iterated Local Search Heuristic for a Capacitated Hub Location Problem....Pages 70-81
Using Memory to Improve the VNS Metaheuristic for the Design of SDH/WDM Networks....Pages 82-93
Multi-level Ant Colony Optimization for DNA Sequencing by Hybridization....Pages 94-109
Hybrid Approaches for Rostering: A Case Study in the Integration of Constraint Programming and Local Search....Pages 110-123
A Reactive Greedy Randomized Variable Neighborhood Tabu Search for the Vehicle Routing Problem with Time Windows....Pages 124-138
Incorporating Inference into Evolutionary Algorithms for Max-CSP....Pages 139-149
Scheduling Social Golfers with Memetic Evolutionary Programming....Pages 150-161
Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem....Pages 162-177
Investigation of One-Go Evolution Strategy/Quasi-Newton Hybridizations....Pages 178-191
Back Matter....Pages -