.png){kind=icon}
返回
Parallel local search algorithms for high school timetabling problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2017.07.029.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
High school timetabling consists in assigning meetings between classes and teachers, with the goal of minimizing the violation of specific soft requirements. This family of problems has been frequently considered in the literature, but few strategies employing parallelism have been proposed. In this exploratory study, we consider two different parallel frameworks and present a thorough computational study in order to understand algorithmic decisions that are closely related to performance. Our best algorithm outperforms state-of-the-art algorithms for variants of the problem considered, indicating both the efficiency and the flexibility of the method. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Timetabling
Parallel metaheuristics
Iterated local search
Tabu search
Simulated annealing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
A column generation approach to high school timetabling modeled as a multicommodity flow problem一种针对高中时间表的列生成方法，该方法被建模为多商品流问题
PREAI
分享收藏
查看更多内容