Construct, Merge, Solve & Adapt
Construct, Merge, Solve & Adapt: A Hybrid Metaheuristic for Combinatorial Optimization
English | 2024 | ISBN: 3031601025 | 208 Pages | PDF EPUB (True) | 31 MB
English | 2024 | ISBN: 3031601025 | 208 Pages | PDF EPUB (True) | 31 MB
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.