.png){kind=icon}
返回
Anytime automatic algorithm selection for knapsack
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2020.113613.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present a new approach for Automatic Algorithm Selection. In this new procedure, we feed the predictor of the best algorithm choice with a runtime limit for the solvers. Hence, the machine learning model should consider and learn from the Anytime Behavior of the solvers, together with features characterizing each instance. For this purpose, we propose a general Framework and apply it to the Knapsack problem. Thus, we created a large and diverse dataset of 15, 000 instances, recorded the anytime behavior of 8 solvers on them and trained and tested three machine learning strategies, collecting the results for different machine learning algorithms. Our results show that, for the majority of the tuples , the solver that computes the best objective value can be predicted. We also make this data publicly available, as a challenge for the community to work in this problem and propose new and better machine learning models and solvers. (C) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Knapsack
Algorithm selection problem
Machine learning techniques
Anytime behaviour approach
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
分享收藏An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem多模式资源受限项目调度问题的自动算法选择方法
OAAI
OAAI分享收藏Highly efficient electrocatalytic hydrogen production by nickel promoted molybdenum sulfide microspheres catalysts镍促进硫化钼微球催化剂的高效电催化制氢.png)
RSC Advances
RSC AdvancesIF0
PREAI
分享收藏
查看更多内容