PKK Library

Your cart is empty.

Welcome to P K Kelkar Library, Online Public Access Catalogue (OPAC)

Normal view MARC view ISBD view

Hybrid Metaheuristics : An Emerging Approach to Optimization /

Contributor(s): Blum, Christian [editor.1] | Aguilera, Maria Jos� Blesa [editor.1 ] | Roli, Andrea [editor.1 ] | Sampels, Michael [editor.2 ] | SpringerLink (Online service)0.
Material type: materialTypeLabelBookSeries: Studies in Computational Intelligence, 1140.Berlin, Heidelberg : Springer Berlin Heidelberg, 2008. Description: X, 290 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540782957.Subject(s): Engineering | Artificial intelligence | Applied mathematics | Engineering mathematics.1 | Engineering.2 | Appl.Mathematics/Computational Methods of Engineering.2 | Artificial Intelligence (incl. Robotics).1DDC classification: 519 Online resources: Click here to access online
Contents:
Hybrid Metaheuristics: An Introduction -- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization -- The Relation Between Complete and Incomplete Search -- Hybridizations of Metaheuristics With Branch & Bound Derivates -- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems -- Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO -- Hybrid Metaheuristics for Packing Problems -- Hybrid Metaheuristics for Multi-objective Combinatorial Optimization -- Multilevel Refinement for Combinatorial Optimisation: Boosting Metaheuristic Performance.
In: Springer eBooks08Summary: Optimization problems are of great importance in many fields. They can be tackled, for example, by approximate algorithms such as metaheuristics. Examples of metaheuristics are simulated annealing, tabu search, evolutionary computation, iterated local search, variable neighborhood search, and ant colony optimization. In recent years it has become evident that a skilled combination of a metaheuristic with other optimization techniques, a so called hybrid metaheuristic, can provide a more efficient behavior and a higher flexibility. This is because hybrid metaheuristics combine their advantages with the complementary strengths of, for example, more classical optimization techniques such as branch and bound or dynamic programming. The authors involved in this book are among the top researchers in their domain. The book is intended both to provide an overview of hybrid metaheuristics to novices of the field, and to provide researchers from the field with a collection of some of the most interesting recent developments.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
PK Kelkar Library, IIT Kanpur
Available EBK870
Total holds: 0

Hybrid Metaheuristics: An Introduction -- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization -- The Relation Between Complete and Incomplete Search -- Hybridizations of Metaheuristics With Branch & Bound Derivates -- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems -- Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO -- Hybrid Metaheuristics for Packing Problems -- Hybrid Metaheuristics for Multi-objective Combinatorial Optimization -- Multilevel Refinement for Combinatorial Optimisation: Boosting Metaheuristic Performance.

Optimization problems are of great importance in many fields. They can be tackled, for example, by approximate algorithms such as metaheuristics. Examples of metaheuristics are simulated annealing, tabu search, evolutionary computation, iterated local search, variable neighborhood search, and ant colony optimization. In recent years it has become evident that a skilled combination of a metaheuristic with other optimization techniques, a so called hybrid metaheuristic, can provide a more efficient behavior and a higher flexibility. This is because hybrid metaheuristics combine their advantages with the complementary strengths of, for example, more classical optimization techniques such as branch and bound or dynamic programming. The authors involved in this book are among the top researchers in their domain. The book is intended both to provide an overview of hybrid metaheuristics to novices of the field, and to provide researchers from the field with a collection of some of the most interesting recent developments.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha