Blum / Gaspero / Schaerf | Hybrid Metaheuristics | Buch | 978-3-642-04917-0 | sack.de

Buch, Englisch, 179 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 300 g

Reihe: Theoretical Computer Science and General Issues

Blum / Gaspero / Schaerf

Hybrid Metaheuristics

6th International Workshop, HM 2009 Udine, Italy, October 16-17, 2009 Proceedings
2009
ISBN: 978-3-642-04917-0
Verlag: Springer

6th International Workshop, HM 2009 Udine, Italy, October 16-17, 2009 Proceedings

Buch, Englisch, 179 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 300 g

Reihe: Theoretical Computer Science and General Issues

ISBN: 978-3-642-04917-0
Verlag: Springer


The International Workshop on Hybrid Metaheuristics was established with the aim of providing researchers and scholars with a forum for discussing new ideas and research on metaheuristics and their integration with techniques typical of other ?elds. The papers accepted for the sixth workshop con?rm that such a combination is indeed e?ective and that several research areas can be put together.Slowlybut surely,thisprocesshasbeen promotingproductivedialogue amongresearcherswithdi?erentexpertiseanderodingbarriersbetweenresearch areas. The papers in this volume give a representativesample of current researchin hybrid metaheuristics. It is worth emphasizing that this year, a large number of papers demonstrated how metaheuristics can be integrated with integer linear programmingandotheroperationsresearchtechniques.Constraintprogramming is also featured, which is a notable representative of arti?cial intelligence solving methods. Most of these papers are not only a proof of concept – which can be valuable by itself – but also show that the hybrid techniques presented tackle di?cult and relevant problems. In keeping with the tradition of this workshop, special care was exercised in the review process: out of 22 submissions received, 12 papers were selected on the basis of reviews by the Program Committee members and evaluations by the Program Chairs. Reviews were in great depth: reviewers sought to p- vide authors with constructive suggestions for improvement. Special thanks are extended to the Program Committee members who devoted their time and - fort. Special gratitude is due to Andrea Lodi and Vittorio Maniezzo, who both accepted our invitation to give an overview talk.

Blum / Gaspero / Schaerf Hybrid Metaheuristics jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Hybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing Problem.- An ELSxPath Relinking Hybrid for the Periodic Location-Routing Problem.- Hybridizing Beam-ACO with Constraint Programming for Single Machine Job Scheduling.- Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows.- A Hybridization of Electromagnetic-Like Mechanism and Great Deluge for Examination Timetabling Problems.- Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem.- Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search.- Effective Hybrid Stochastic Local Search Algorithms for Biobjective Permutation Flowshop Scheduling.- Hierarchical Iterated Local Search for the Quadratic Assignment Problem.- Incorporating Tabu Search Principles into ACO Algorithms.- A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal ?+?+?.- Multi-neighborhood Local Search for the Patient Admission Problem.- Matheuristics: Optimization, Simulation and Control.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.