2018
DOI: 10.1007/978-3-030-05983-5_1
|View full text |Cite
|
Sign up to set email alerts
|

Generic CP-Supported CMSA for Binary Integer Linear Programs

Abstract: Construct, Merge, Solve & Adapt (CMSA) is a general hybrid metaheuristic for solving combinatorial optimization problems. At each iteration, CMSA (1) constructs feasible solutions to the tackled problem instance in a probabilistic way and (2) solves a reduced problem instance (if possible) to optimality. The construction of feasible solutions is hereby problem-specific, usually involving a fast greedy heuristic. The goal of this paper is to design a problem-agnostic CMSA variant whose exclusive input is an int… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…One of the new features of CMSA++ (in comparison to the original version from [11]) is a dynamic mechanism for adjusting the determinism rate (d rate * ) used during the solution construction at each iteration. The mechanism is the same as that described in [32]. In the original CMSA, this determinism rate was a fixed value between 0 and 1, determined by algorithm tuning.…”
Section: Algorithm 1 Cmsa++ For the Capmds Problemmentioning
confidence: 99%
“…One of the new features of CMSA++ (in comparison to the original version from [11]) is a dynamic mechanism for adjusting the determinism rate (d rate * ) used during the solution construction at each iteration. The mechanism is the same as that described in [32]. In the original CMSA, this determinism rate was a fixed value between 0 and 1, determined by algorithm tuning.…”
Section: Algorithm 1 Cmsa++ For the Capmds Problemmentioning
confidence: 99%