Putting continuous metaheuristics to work in binary search spaces (Q2012877)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Putting continuous metaheuristics to work in binary search spaces |
scientific article; zbMATH DE number 6756013
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Putting continuous metaheuristics to work in binary search spaces |
scientific article; zbMATH DE number 6756013 |
Statements
Putting continuous metaheuristics to work in binary search spaces (English)
0 references
3 August 2017
0 references
Summary: In the real world, there are a number of optimization problems whose search space is restricted to take binary values; however, there are many continuous metaheuristics with good results in continuous search spaces. These algorithms must be adapted to solve binary problems. This paper surveys articles focused on the binarization of metaheuristics designed for continuous optimization.
0 references
optimization problems
0 references
binary values
0 references
metaheuristics
0 references
0 references
0 references
0 references
0 references
