The effect of neighborhood structures on tabu search algorithm in solving course timetabling problem

  • Authors:

  • Cagdas Hakan Aladag;Gulsum Hocaoglu;Murat Alper Basaran

  • Affiliations:

  • Department of Statistics, Hacettepe University, Ankara 06800, Turkey;Department of Statistics, Hacettepe University, Ankara 06800, Turkey;Department of Mathematics, Nigde University, Nigde 51000, Turkey

  • Venue:
  • Expert Systems with Applications: An International Journal
  • Year:
  • 2009

Quantified Score

Hi-index 12.06

Visualization

Abstract

The course timetabling problem must be solved by the departments of Universities at the beginning of every semester. It is a though problem which requires department to use humans and computers in order to find a proper course timetable. One of the most mentioned difficult nature of the problem is context dependent which changes even from departments to departments. Different heuristic approaches have been proposed in order to solve this kind of problem in the literature. One of the efficient solution methods for this problem is tabu search. Different neighborhood structures based on different types of move have been defined in studies using tabu search. In this paper, the effects of moves called simple and swap on the operation of tabu search are examined based on defined neighborhood structures. Also, two new neighborhood structures are proposed by using the moves called simple and swap. The fall semester of course timetabling problem of the Department of Statistics at Hacettepe University is solved utilizing four neighborhood structures and the comparison of the results obtained from these structures is given.