arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1309.3285cs.AI
收藏

一种具有有效多样化策略的高中排课禁忌搜索算法

A tabu search algorithm with efficient diversification strategy for high school timetabling problem

Hamedan University of Technology(哈马丹理工大学);Islamic Azad University(伊斯兰阿扎德大学)

Salman Hooshmand, Mehdi Behshameh, Omid Hamidi

摘要:

学校排课问题可以被描述为在每周的时间表中安排一组课程(班级、教师、科目和教室的组合)。本文提出了一种新的方法来生成高中课程表。该算法有三个阶段。预排程、初始阶段和禁忌搜索优化。在第一阶段,一个基于图的算法用于创建组的教训,同时安排,然后建立一个初始的解决方案,由顺序贪婪启发式。最后,采用基于频率多样化的禁忌搜索算法对解进行优化。该算法已在一组从伊朗高中收集的实际问题上进行了测试。实验表明,该算法能有效地生成可接受的时刻表.

英文摘要:

The school timetabling problem can be described as scheduling a set of lessons (combination of classes, teachers, subjects and rooms) in a weekly timetable. This paper presents a novel way to generate timetables for high schools. The algorithm has three phases. Pre-scheduling, initial phase and optimization through tabu search. In the first phase, a graph based algorithm used to create groups of lessons to be scheduled simultaneously; then an initial solution is built by a sequential greedy heuristic. Finally, the solution is optimized using tabu search algorithm based on frequency based diversification. The algorithm has been tested on a set of real problems gathered from Iranian high schools. Experiments show that the proposed algorithm can effectively build acceptable timetables.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑