Viac ako 4 milióny titulov v angličtine aj ďalších jazykoch! Objavte svoj nový príbeh ešte dnes!

Construct, Merge, Solve & Adapt

Name: Construct, Merge, Solve & Adapt
Brand: Springer, Berlin
SKU: 9783031601026
Price: 139.38 EUR
Availability: InStock

A Hybrid Metaheuristic for Combinatorial Optimization

Autor: Christian Blum

Jazyk:

Väzba: Pevná

Vydavateľ: Springer, Berlin

Dostupnosť: Skladom u dodávateľa

Odosielame za 10-18 dní

139.38 €

This book describes a general hybrid metaheuristic for combinatorial optimization labeled Construct,...

Informácie o knihe

Autor

Christian Blum

Jazyk

Angličtina

Väzba

Kniha - Pevná

Vydalo

2024

Stránok

190

EAN

9783031601026

Enbook ID

45727465

Vydavateľ

Springer, Berlin

Hmotnosť

426

Rozmery

155 x 235

Kompletný popis

This book describes a general hybrid metaheuristic for combinatorial optimization labeled Construct, Merge, Solve & Adapt (CMSA). The general idea of standard CMSA is the following one. At each iteration, a number of valid solutions to the tackled problem instance are generated in a probabilistic way. Hereby, each of these solutions is composed of a set of solution components. The components found in the generated solutions are then added to an initially empty sub-instance. Next, an exact solver is applied in order to compute the best solution of the sub-instance, which is then used to update the sub-instance provided as input for the next iteration. In this way, the power of exact solvers can be exploited for solving problem instances much too large for a standalone application of the solver.Important research lines on CMSA from recent years are covered in this book. After an introductory chapter about standard CMSA, subsequent chapters cover a self-adaptive CMSA variant as well as a variant equipped with a learning component for improving the quality of the generated solutions over time. Furthermore, on outlining the advantages of using set-covering-based integer linear programming models for sub-instance solving, the author shows how to apply CMSA to problems naturally modelled by non-binary integer linear programming models. The book concludes with a chapter on topics such as the development of a problem-agnostic CMSA and the relation between large neighborhood search and CMSA. Combinatorial optimization problems used in the book as test cases include the minimum dominating set problem, the variable-sized bin packing problem, and an electric vehicle routing problem.The book will be valuable and is intended for researchers, professionals and graduate students working in a wide range of fields, such as combinatorial optimization, algorithmics, metaheuristics, mathematical modeling, evolutionary computing, operations research, artificial intelligence, or statistics.

Najčastejšie vyhľadávané

Categories

Authors

Publishers

Produkty

Produkty

Najčastejšie vyhľadávané

Categories

Authors

Publishers

Produkty

Produkty

Construct, Merge, Solve & Adapt

A Hybrid Metaheuristic for Combinatorial Optimization

Informácie o knihe

Kompletný popis

Mohlo by vás zaujímať

Jazz Poetry Anthology

Universal Salvation Indefensible Upon Mr. Balfour's Ground: A Reply To An Inquiry

Achieving Financial Stability: Challenges To Prudential Regulation

30 Worksheets - Less Than for 2 Digit Numbers: Math Practice Workbook

Insurance in India: Principles and Practices

Foundation Models for General Medical AI

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

Zur Psychopathologie des Alltagslebens

Das Gold Von Caxamalca

Les merveilleuses pâtisseries de Billy - tome 1 Méli-mélo à la framboise

STRING QUARTET NO. 7 F# MINOR OP. 108 POCHE

Kto sa skrýva na farme?