.png){kind=icon}
返回
Variable Neighborhood Search based algorithms for high school timetabling
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2013.11.012.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This work presents the application of Variable Neighborhood Search (VNS) based algorithms to the High School Timetabling Problem. The addressed model of the problem was proposed by the Third International Timetabling Competition (ITC 2011), which released many instances from educational institutions around the world and attracted 17 competitors. Some of the VNS algorithm variants were able to outperform the winner of Third ITC solver, which proposed a Simulated Annealing - Iterated local Search approach. This result coupled with another reports in the literature points that VNS based algorithms are a practical solution method for providing high quality solutions for some hard timetabling problems. Moreover they are easy to implement with few parameters to adjust. (C) 2014 Published by Elsevier Ltd.
Keyword:
Variable Neighborhood Search
High School Timetabling Problem
Third International Timetabling
Competition
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Application of a novel magnetic nanoparticle as demulsifier for dewatering in crude oil emulsion
PREAI
分享收藏An integer programming formulation for a case study in university timetabling用于大学时间表案例研究的整数规划公式
PREAI
分享收藏分享收藏
查看更多内容