4.5 Review

Putting Continuous Metaheuristics to Work in Binary Search Spaces

期刊

COMPLEXITY
卷 -, 期 -, 页码 -

出版社

WILEY-HINDAWI
DOI: 10.1155/2017/8404231

关键词

-

资金

  1. INF-PUCV
  2. Pontificia Universidad Catolica de Valparaiso
  3. [CONICYT/FONDECYT/REGULAR/1171243]
  4. [CONICYT/FONDECYT/REGULAR/1160455]

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据