Solving the Exam Timetabling Problem via a Multi-Objective Evolutionary Algorithm - A More General Approach

Solving the Exam Timetabling Problem via a Multi-Objective Evolutionary Algorithm - A More General Approach
复制标题

DOI:
10.1109/scis.2007.367685
复制
发表时间:
2007-04
期刊:
2007 IEEE Symposium on Computational Intelligence in Scheduling
影响因子:
--
通讯作者:
C. Cheong;K. Tan;B. Veeravalli
C. Cheong;K. Tan;B. Veeravalli
中科院分区:
其他
文献类型:
--
作者:
C. Cheong;K. Tan;B. Veeravalli

文献摘要

被引文献

相似文献

本文研究了大学考试时间表问题的多目标实例。除了满足座位数和考试不重叠等普遍硬性约束外,解决这个问题还需要尽量减少时间表的长度以及学生在同一天连续考试的次数。虽然解决该问题的大多数现有方法以及更流行的单目标实例需要先验知识所需的时间表长度,但本文提出的多目标进化算法即使在没有信息的情况下也能够生成可行的解决方案。所提出的算法的有效性与一些最近和已建立的优化技术进行了基准测试,并且发现在比较中表现良好
This paper studies a multi-objective instance of the university exam timetabling problem. On top of satisfying universal hard constraints such as seating capacity and no overlapping exams, the solution to this problem requires the minimization of the timetable length as well as the number of occurrences of students having to take exams in consecutive periods within the same day. While most existing approaches to the problem, as well as the more popular single-objective instance, require prior knowledge of the desired timetable length, the multi-objective evolutionary algorithm proposed in this paper is able to generate feasible solutions even without the information. The effectiveness of the proposed algorithm is benchmarked against a few recent and established optimization techniques and is found to perform well in comparison