Construct, Merge, Solve & Adapt A Hybrid Metaheuristic for Combinatorial Optimization /
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 probabilisti...
Saved in:
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cham :
Springer Nature Switzerland : Imprint: Springer,
2024.
|
| Edition: | 1st ed. 2024. |
| Series: | Computational Intelligence Methods and Applications,
|
| Subjects: | |
| Online Access: | https://doi.org/10.1007/978-3-031-60103-3 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-60103-3 | ||
| 003 | DE-He213 | ||
| 005 | 20260810170508.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 240619s2024 sz | o |||| 0|eng d | ||
| 020 | |a 9783031601033 |9 978-3-031-60103-3 | ||
| 024 | 7 | |a 10.1007/978-3-031-60103-3 |2 doi | |
| 050 | 4 | |a Q334-342 | |
| 050 | 4 | |a TA347.A78 | |
| 072 | 7 | |a UYQ |2 bicssc | |
| 072 | 7 | |a COM004000 |2 bisacsh | |
| 072 | 7 | |a UYQ |2 thema | |
| 082 | 0 | 4 | |a 006.3 |2 23 |
| 100 | 1 | |a Blum, Christian. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Construct, Merge, Solve & Adapt |h [electronic resource] : |b A Hybrid Metaheuristic for Combinatorial Optimization / |c by Christian Blum. |
| 250 | |a 1st ed. 2024. | ||
| 264 | 1 | |a Cham : |b Springer Nature Switzerland : |b Imprint: Springer, |c 2024. | |
| 300 | |a 1 online resource (XVI, 192 p. 58 illus.). |b 43 illus. in color. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a Computational Intelligence Methods and Applications, |x 2510-1773 | |
| 505 | 0 | |a Introduction to CMSA -- Self-Adaptive CMSA -- Adding Learning to CMSA -- Replacing Hard Mathematical Models with Set Covering Formulations -- Application of CMSA in the Presence of Non-Binary Variables -- Additional Research Lines Concerning CMSA. | |
| 520 | |a 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. | ||
| 588 | |a Print version record. | ||
| 650 | 0 | |a Artificial intelligence. | |
| 650 | 0 | |a Computational intelligence. | |
| 650 | 0 | |a Computer science. | |
| 650 | 0 | |a Operations research. | |
| 650 | 0 | |a Management science. | |
| 650 | 0 | |a Computer simulation. | |
| 650 | 1 | 4 | |a Artificial Intelligence. |
| 650 | 2 | 4 | |a Computational Intelligence. |
| 650 | 2 | 4 | |a Theory of Computation. |
| 650 | 2 | 4 | |a Operations Research, Management Science. |
| 650 | 2 | 4 | |a Computer Modelling. |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783031601026 |
| 776 | 0 | 8 | |i Printed edition: |z 9783031601040 |
| 776 | 0 | 8 | |i Printed edition: |z 9783031601057 |
| 830 | 0 | |a Computational Intelligence Methods and Applications, |x 2510-1773 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-031-60103-3 |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||