Automated Solution of a Highly Constrained School Timetabling Problem - Preliminary Results
Automated Solution of a Highly Constrained School Timetabling Problem - Preliminary Results
复制标题
高度受限的学校时间表问题的自动化解决方案 - 初步结果
DOI：
--
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
Christian Wolfangel
中科院分区：
文献类型：
--
作者：
Marc Bufé;T. Fischer;Holger Gubbels;Claudius Häcker;Oliver Hasprich;C. Scheibel;Karsten Weicker;N. Weicker;Michael Wenig;Christian Wolfangel
这项工作介绍了一个高度约束的学校排课问题，这是仿照德国高中的要求。解决问题的概念使用混合方法。一方面，进化算法搜索事件的所有排列的空间，时间表生成器从中生成学校时间表。这些时间表进一步优化局部搜索使用特定的变异算子。因此，仅生成满足所有硬约束的有效（部分）时间表。
This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hybrid approach. On the one hand an evolutionary algorithm searches the space of all permutations of the events from which a timetable builder generates the school timetables. Those timetables are further optimized by local search using specific mutation operators. Thus, only valid (partial) timetables are generated which fulfill all hard constraints.