.png){kind=icon}
返回
Algorithm selection for solving educational timetabling problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2021.114694.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present the construction process of a per-instance algorithm selection model to improve the initial solutions of Curriculum-Based Course Timetabling (CB-CTT) instances. Following the meta-learning framework, we apply a hybrid approach that integrates the predictions of a classifier and linear regression models to estimate and compare the performance of four meta-heuristics across different problem sub-spaces described by seven types of features. Rather than reporting the average accuracy, we evaluate the model using the closed SBS-VBS gap, a performance measure used at international algorithm selection competitions. The experimental results show that our model obtains a performance of 0.386, within the range obtained by perinstance algorithm selection models in other combinatorial problems. As a result of the process, we conclude that the performance variation between the meta-heuristics has a significant role in the effectiveness of the model. Therefore, we introduce statistical analyses to evaluate this factor within per-instance algorithm portfolios.
Keyword:
Algorithm selection
Meta-learning
Educational timetabling
Meta-heuristic
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
引用论文
An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem多模式资源受限项目调度问题的自动算法选择方法
OAAI
OAAI分享收藏
分享收藏分享收藏MetaStream: A meta-learning based method for periodic algorithm selection in time-changing dataMetaStream: 一种基于元学习的时变数据周期性算法选择方法.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏分享收藏
查看更多内容