Hybrid Metaheuristics: Second International Workshop, HM 2005, Barcelona, Spain, August 29-30, 2005. Proceedings

Front Cover
María José Blesa Aguilera, María J. Blesa, Christian Blum, Andrea Roli, Michael Sampels
Springer Science & Business Media, Aug 17, 2005 - Computers - 153 pages
Combinatorial optimization and in particular the great variety of fascinating problemsthatbelong to thisareahaveattractedmanyresearchersformorethan halfacentury.Duetothepracticalrelevanceofsolvinghardreal-worldproblems, much research e?ort has been devoted to the development of heuristic methods aimed at ?nding good approximate solutions in a reasonable computation time. Some solution paradigms that are not speci?c for one particular problem have been deeply studied in the past, and the term metaheuristic is now common for such optimization heuristics. Several metaheuristics – simulated annealing, - netic and evolutionary algorithms, tabu search, ant colony optimization, scatter search, iterated local search, and greedy randomized adaptive search procedures beingsomeofthem–havefoundtheirownresearchcommunities,andspecialized conferences devoted to such techniques have been organized. Plenty of classical hard problems, such as the quadratic assignment pr- lem, the traveling salesman problem, problems in vehicle routing, scheduling, and timetabling, etc., have been tackled successfully with metaheuristic - proaches. Several thereof are currently considered state-of-the-art methods for solving such problems. However, for many years the main focus of research was on the application of single metaheuristics to given problems. A tendency to compare di?erent metaheuristics against each other could be observed, and sometimes this competition led to thinking in stereotypes in the research communities.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Message Passing vs Shared Memory
1
An LPBased Hybrid Heuristic Procedure for the Generalized Assignment Problem with Special Ordered Sets
12
Parametrized Greedy Heuristics in Theory and Practice
21
A Taxonomy of Cooperative Search Algorithms
32
A Hybrid Genetic and Variable Neighborhood Descent for Probabilistic SAT Problem
42
A Hybrid Metaheuristic Approach for Natural Gas Pipeline Network Optimization
54
Hybrid Tabu Search for Lot Sizing Problems
66
Fast Ejection Chain Algorithms for Vehicle Routing with Time Windows
78
3D Intersubject Medical Image Registration by Scatter Search
90
Evolution Strategies and Threshold Selection
104
A Hybrid GRASP with Data Mining for the Maximum Diversity Problem
116
A New Multiobjective Particle Swarm Optimization Algorithm Using Clustering Applied to Automated Docking
128
A Hybrid GRASPPath Relinking Algorithm for the Capacitated p hub Median Problem
142
Author Index
154
Copyright

Other editions - View all

Common terms and phrases