Cart 0
Construct, Merge, Solve & Adapt
Click to zoom

Share this book

Construct, Merge, Solve & Adapt : A Hybrid Metaheuristic for Combinatorial Optimization

2024 ed.

Book Details

Format Hardback or Cased Book
ISBN-10 3031601025
ISBN-13 9783031601026
Edition 2024 ed.
Publisher Springer International Publishing AG
Imprint Springer International Publishing AG
Country of Manufacture GB
Country of Publication GB
Publication Date Jun 19th, 2024
Print length 192 Pages
Ksh 23,400.00
Werezi Extended Catalogue 0 in stock

Delivery Location

Delivery fee: Select location

Secure
Quality
Fast

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.


Get Construct, Merge, Solve & Adapt by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Springer International Publishing AG and it has pages.

Mind, Body, & Spirit

Shopping Cart

Africa largest book store

Sub Total:
Ebooks

Digital Library
Coming Soon

Our digital collection is currently being curated to ensure the best possible reading experience on Werezi. We'll be launching our Ebooks platform shortly.