{"product_id":"construct-merge-solve-adapt-9783031601057","title":"Construct, Merge, Solve \u0026 Adapt: A Hybrid Metaheuristic for Combinatorial Optimization","description":"This book describes a general hybrid metaheuristic for combinatorial optimization labeled Construct, Merge, Solve \u0026amp; 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.\u003cul\u003e\n\u003cli\u003e\n\u003cstrong\u003ePublication date:\u003c\/strong\u003e 20 June 2025\u003c\/li\u003e\n\u003cli\u003e\n\u003cstrong\u003ePage count:\u003c\/strong\u003e 192\u003c\/li\u003e\n\u003cli\u003e\n\u003cstrong\u003eDimensions:\u003c\/strong\u003e Height 235 mm; Width 155 mm\u003c\/li\u003e\n\u003cli\u003e\n\u003cstrong\u003ePublisher:\u003c\/strong\u003e Springer International Publishing AG\u003c\/li\u003e\n\u003cli\u003e\n\u003cstrong\u003eFormat:\u003c\/strong\u003e Paperback\u003c\/li\u003e\n\u003cli\u003e\n\u003cstrong\u003eISBN-13:\u003c\/strong\u003e 9783031601057\u003c\/li\u003e\n\u003c\/ul\u003e","brand":"Christian Blum","offers":[{"title":"Paperback","offer_id":50207652020474,"sku":"9783031601057","price":107.37,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0522\/4297\/2845\/files\/9783031601057.jpg?v=1788229971","url":"https:\/\/shulphink.com\/products\/construct-merge-solve-adapt-9783031601057","provider":"Shulph Ink","version":"1.0","type":"link"}