Improving Exam Timetabling Solution Using TABU Search
نویسندگان
چکیده
A feasible exam timetable is generated using a method based on constraint satisfaction and heuristics. We investigate the usage of tabu search to further improve the quality of the exam timetable. Different length of short term tabu list and the long term tabu list is examined. Short term tabu list without long term tabu list and vice versa is also tested. Different search iteration based on maximum null iteration and maximum tabu relaxation is also considered. Experiments are carried out on an actual dataset from Universiti Sains Malaysia. Results from these experiments show the relative significance of long term tabu list relative to short term tabu list for this dataset.
منابع مشابه
A graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Within the hyperheuristic framework, a Tabu Search approach is employed to search for permutations of graph heuristics which are used for constructing timetables in exam and course timetabling problems. This underpins a m...
متن کاملA Case Based Heuristic Selection investigation of Hill Climbing, Simulated Annealing and Tabu Search for Exam Timetabling Problems
The examination timetabling problem has been studied in many different forms and using a variety of techniques over the years [1], [3], [4], [6]. In its simplest form, it is required that a set of exams are scheduled into a set of time periods in such a way that no two exams with students in common are scheduled at the same time. In practice there are a wide range of other constraints which mus...
متن کاملHybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems
This paper is concerned with the hybridization of two graph coloring heuristics (Saturation Degree and Largest Degree), and their application within a hyperheuristic for exam timetabling problems. Hyper-heuristics can be seen as algorithms which intelligently select appropriate algorithms/heuristics for solving a problem. We developed a Tabu Search based hyper-heuristic to search for heuristic ...
متن کاملAnalysing the High Level Heuristics within a Graph Based Hyper-heuristic
This paper presents our work on analysing high level heuristics within a graph based hyper-heuristic framework. Local search based methods (Tabu Search and steepest descent method) are compared as the high level heuristics within the graph based hyper-heuristic framework and the analysis of their neighborhood structures and performance on the high level landscape is carried out. An iterated ste...
متن کاملUsing Simulated Annealing to study behaviour of various Exam Timetabling data sets
In this paper we use a simple simulated annealing (SA) metaheuristic as the basis for comparing behaviour of a number of different examination timetabling problems when optimised from initial solutions given by a largest degree graph-colouring heuristic with backtracking. The ultimate aim of our work is to develop a measure of similarity between exam timetabling problems. By similarity we mean ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JDIM
دوره 3 شماره
صفحات -
تاریخ انتشار 2005