Hybrid Metaheuristics

4th International Workshop,HM 2007, Dortmund, Germany, October 8-9, 2007, Proceedings

Thomas Bartz-Beielstein, Maria J. Blesa, Christian Blum, Boris Naujoks, Andrea Roli, Günther Rudolph, Michael Sampels (Herausgeber)

Buch | Softcover

X, 201 Seiten

2007 | 2007
Springer Berlin (Verlag)
978-3-540-75513-5 (ISBN)

Artikel merken

lt;p>This book constitutes the refereed proceedings of the 4th International Workshop on Hybrid Metaheuristics, HM 2007, held in Dortmund, Germany. The 14 revised full papers discuss specific aspects of hybridization of metaheuristics, hybrid metaheuristics design, development and testing. With increasing attention to methodological aspects, from both the empirical and theoretical sides, the papers show a representative sample of research in the field of hybrid metaheuristics.

Evolutionary Local Search for the Super-Peer Selection Problem and the p-Hub Median Problem.- An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem.- Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems.- Guiding ACO by Problem Relaxation: A Case Study on the Symmetric TSP.- Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem.- Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop.- A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy.- On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case.- Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement.- Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge.- Gradient-Based/Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric.- A Hybrid VNS for Connected Facility Location.- A Memetic Algorithm for the Optimum Communication Spanning Tree Problem.- Hybrid Numerical Optimization for Combinatorial Network Problems.

Erscheint lt. Verlag	28.9.2007
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	X, 201 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	334 g
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
Themenwelt	Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
Schlagworte	Algorithm analysis and problem complexity • Algorithmics • algorithms • ant colony optimization • approximation algorithms • clustering search • combinatorial optimization • Constraint Programming • Constraint Satisfaction • Data Analysis • evolutionary algorithms • Genetic algorithms • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Heuristics • hybrid heuristics • Hybridization • Local Search • machine learning • memetic algorithm • Meta • Metaheuristics • Multi-Objective Optimization • Optimization • Parallelization • programming • scatter search • Simulated annealing • Tabu Search • Taxonomy • Vehicle Routing
ISBN-10	3-540-75513-6 / 3540755136
ISBN-13	978-3-540-75513-5 / 9783540755135
Zustand	Neuware