.png){kind=icon}
返回
Black box scatter search for general classes of binary optimization problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2010.01.013.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represented as binary vectors and that may or may not include constraints. Binary problems arise in a variety of settings, including engineering design and statistical mechanics (e.g., the spin glass problem). A distinction is made between two sets of general constraint types that are handled directly by the solver and other constraints that are addressed via penalty functions. In both cases, however, the heuristic treats the objective function evaluation as a black box. We perform computational experiments with four well-known binary optimization problems to study the efficiency (speed) and effectiveness (solution quality) of the proposed method. Comparisons are made against both commercial software and specialized procedures on a set of 376 instances. We chose commercial software that is similar in nature to the proposed procedure, namely, it treats the objective function as a black box and the search is based on evolutionary optimization techniques. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Optimization
Metaheuristics
Hard optimization problems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Resin Canals in Pinus Taeda: Longitudinal Canal Lengths and Interconnections Between Longitudinal and Radial Canals.png)
IAWA JournalOAAI
IAWA JournalIF0
OAAI分享收藏
查看更多内容