Menu
Виж статуса на поръчката
Свържете се с нас
Книга Construct, Merge, Solve & Adapt Christian Blum

Construct, Merge, Solve & Adapt

A Hybrid Metaheuristic for Combinatorial Optimization

Автор: Christian Blum
Език: Английски език
Корици: С твърди корици
Издател: Springer, Berlin
Наличност: Външен склад
Изпращаме след 10-18 дни
147.16 € 287.82 лв
This book describes a general hybrid metaheuristic for combinatorial optimization labeled Construct,...

Информация за книгата

Автор
Christian Blum
Език
Английски език
Корици
Книга - С твърди корици
Издадена
2024
страници
190
EAN
9783031601026
Enbook ID
45727465
Издател
Springer, Berlin
Теглоt
426
Размери
155 x 235

Пълно описание

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.

Може също да ви хареса

Jazz Poetry Anthology

Sascha Feinstein
30.11 € 58.89 лв

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

James Sabine
22.39 € 43.80 лв

Achieving Financial Stability: Challenges To Prudential Regulation

Agnese Leonello
150.32 € 294.00 лв

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

Kapoo Stem
7.41 € 14.49 лв

Bleach (2-in-1 Edition), Vol. 25

Tite Kubo
13.17 € 25.76 лв

Insurance in India: Principles and Practices

Dr Altaf Ahmad Dar Dar
27.45 € 53.70 лв

Foundation Models for General Medical AI

Hyunwoo J. Kim
52.71 € 103.09 лв

Клиенти, които купиха тази книга, купиха също

Zur Psychopathologie des Alltagslebens

Sigmund Freud
18.43 € 36.06 лв

Das Gold Von Caxamalca

Jakob Wassermann
22.94 € 44.88 лв

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

Harriet Whitehorn
9.06 € 17.73 лв

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

DIMITRI SHOSTAKOVICH
21.24 € 41.54 лв

Puzzle 1000 Queen Elizabeth II 6000-0919

14.73 € 28.80 лв

Kto sa skrýva na farme?

4.50 € 8.81 лв