Improving Exam Time Tabling Solution Using Tabu Search

Khader, Ahamad Tajudin; Ang Siew See
December 2005
Journal of Digital Information Management;Dec2005, Vol. 3 Issue 4, p250
Academic Journal
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.


Related Articles

  • Interactive visual exploration of association rules with rule-focusing methodology. Blanchard, Julien; Guillet, Fabrice; Briand, Henri // Knowledge & Information Systems;Sep2007, Vol. 13 Issue 1, p43 

    On account of the enormous amounts of rules that can be produced by data mining algorithms, knowledge post-processing is a difficult stage in an association rule discovery process. In order to find relevant knowledge for decision making, the user (a decision maker specialized in the data...

  • Mining Non-Redundant Association Rules. Zaki, Mohammed J. // Data Mining & Knowledge Discovery;Nov2004, Vol. 9 Issue 3, p223 

    The traditional association rule mining framework produces many redundant rules. The extent of redundancy is a lot larger than previously suspected. We present a new framework for associations based on the concept of closed frequent itemsets. The number of non-redundant rules produced by the new...

  • Efficient Mining of Frequent Patterns Using Ascending Frequency Ordered Prefix-Tree. Guimei Liu; Hongjun Lu; Wenwu Lou; Yabo Xu; Yu, Jeffrey Xu // Data Mining & Knowledge Discovery;Nov2004, Vol. 9 Issue 3, p249 

    Mining frequent patterns, including mining frequent closed patterns or maximal patterns, is a funda- mental and important problem in data mining area. Many algorithms adopt the pattern growth approach, which is shown to be superior to the candidate generate-and-test approach, especially when...

  • Efficient Algorithms for Mining and Incremental Update of Maximal Frequent Sequences. Kao, Ben; Minghua Zhang; Chi-Lap Yip; Cheung, David W. // Data Mining & Knowledge Discovery;Mar2005, Vol. 10 Issue 2, p87 

    We study two problems: (1) mining frequent sequences from a transactional database, and (2) incremental update of frequent sequences when the underlying database changes over time. We review existing sequence mining algorithms including GSP, PrefixSpan, SPADE, and ISM. We point out the large...

  • On the Use of Wavelet Decomposition for String Classification. Aggarwal, Charu C. // Data Mining & Knowledge Discovery;Mar2005, Vol. 10 Issue 2, p117 

    In recent years, the technological advances in mapping genes have made it increasingly easy to store and use a wide variety of biological data. Such data are usually in the form of very long strings for which it is difficult to determine the most relevant features for a classification task. For...

  • Hierarchical Clustering Algorithms for Document Datasets. Ying Zhao; Karypis, George // Data Mining & Knowledge Discovery;Mar2005, Vol. 10 Issue 2, p141 

    Fast and high-quality document clustering algorithms play an important role in providing intuitive navigation and brow sing mechanisms by organizing large amounts of information into a small number of meaningful clusters. In particular, clustering algorithms that build meaningful hierarchies out...

  • Evaluation of ordinal attributes at value level. Robnik-┼áikonja, Marko; Vanhoof, Koen // Data Mining & Knowledge Discovery;Apr2007, Vol. 14 Issue 2, p225 

    We propose a novel context sensitive algorithm for evaluation of ordinal attributes which exploits the information hidden in ordering of attributes' and class' values and provides a separate score for each value of the attribute. Similar to feature selection algorithm ReliefF, the proposed...

  • Partitioning for Profit: An Empirical Study of Methods for Handling Unequal Costs of Error in Predictive Data Mining. Abrahams, Alan; Becker, Adrian // Group Decision & Negotiation;Mar2007, Vol. 16 Issue 2, p191 

    This paper expands prior work on the Sequential Binary Programming (SBP) algorithm as a framework for cost-sensitive classification. The field of cost-sensitive learning has provided a number of methods to adapt predictive data mining from engineering and hard science applications to those in...

  • Finding Fuzzy Association Rules Using FWFP-Growth with Linguistic Supports and Confidences. Chien-Hua Wang; Chin-Tzong Pang // International Journal of Computational Intelligence;2009, Vol. 5 Issue 4, p300 

    In data mining, the association rules are used to search for the relations of items of the transactions database. Following the data is collected and stored, it can find rules of value through association rules, and assist manager to proceed marketing strategy and plan market framework. In this...

  • Mining Version Histories to Guide Software Changes. Zimmermann, Thomas; Weibgerber, Peter; Diehi, Stephan; Zeller, Andreas // IEEE Transactions on Software Engineering;Jun2005, Vol. 31 Issue 6, p429 

    We apply data mining to version histories in order to guide programmers along related changes: "Programmers who changed these functions also changed...." Given a set of existing changes, the mined association rules 1) suggest and predict likely further changes, 2) show up item coupling that is...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics