Construct, Merge, Solve & Adapt (eng)
Blum, Christian
Sold by Brook Bookstore On Demand, Napoli, NA, Italy
AbeBooks Seller since October 11, 2022
New - Soft cover
Condition: New
Quantity: Over 20 available
Add to basketSold by Brook Bookstore On Demand, Napoli, NA, Italy
AbeBooks Seller since October 11, 2022
Condition: New
Quantity: Over 20 available
Add to basketQuesto è un articolo print on demand.
Seller Inventory # SDJ4QDCJ5E
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.
Christian Blum is a Senior Research Scientist at the Artificial Intelligence Research Institute (IIIA) and the Spanish National Research Council (CSIC). He is one of the most influential researchers at the intersection of Artificial Intelligence, Operations Research, Optimization, Heuristics, Natural Computing and Computational Intelligence. He is the co-editor of "Swarm Intelligence" (Springer, 2006) and co-author of "Hybrid Metaheuristics" (Springer, 2016).
"About this title" may belong to another edition of this title.
Account dedicated to Print on Demand titles.
CANCELLATION
You can send a cancellation request from the order page while the package has not yet been shipped. After that we cannot ensure we can retrieve the parcel but we suggest you to get in touch with us in order to verify the case.
INVOICE
You can request the invoice to be issued together with the shipment of the order or, at the latest, in the same month of the shipment.
RETURNS
If you want to return your order, please contact us for authoriz...
Order quantity | 25 to 40 business days | 60 to 60 business days |
---|---|---|
First item | US$ 6.50 | US$ 604.30 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.