A two-phase Clustering and Tabu Search Algorithm for Solving Exam Timetabling Problem
Exam timetabling problem is a number of exams which should be scheduled to a limited number of time periods (timeslots) subject to a variety of constraints. In this paper, we present a new two-phase algorithm. Clustering and Tabu Search Algorithm for solving Exam Timetabling problem. In the first step, a set of exams is clustered to the suitable clusters based on the number of timeslots. We proposed a new clustering algorithm to clustering a set of exams. Then, in the second step, we use Tabu search Algorithm to find the best timeslot for each cluster. Experimental results on Toronto benchmark show the improvements over the existing algorithms for solving examination timetabling problems.
Exam Timetabling Clustering Algorithm Tabu search Algorithm
Roohollah Etemadi Nasrolah Moghaddam
Department of Electrical and computer engineering Islamic Azad University Bonab Branch Bonab, Iran Department of Electrical and computer engineering Tarbiat Modarres University Tehran, Iran
国际会议
重庆
英文
159-164
2011-01-21（万方平台首次上网日期，不代表论文的发表时间）