Title: A new approach for university timetabling problems

Authors: Rakesh P. Badoni; D.K. Gupta; Anil K. Lenka

Addresses: Department of Mathematics, Indian Institute of Technology, Kharagpur 721 302, West Bengal, India ' Department of Mathematics, Indian Institute of Technology, Kharagpur 721 302, West Bengal, India ' Wipro Technologies, Bangalore 560 068, Karnataka, India

Abstract: A general university timetabling problem formulated as a constraint satisfaction problem is solved by a new backtrack-free algorithm. This algorithm incrementally constructs a solution as is done by the usual backtracking algorithm. Whenever a dead-end is encountered, rather than backtracking to the previously assigned variable, it resolves its cause by using a local search min-conflicts-hill-climbing algorithm and then continues further progressively. The proposed algorithm is tested on a small dataset and its representative timetable is presented. It is also tested on a number of randomly generated university timetabling problems. The performance of the algorithm measured in terms of the number of iterations and the amount of CPU time in seconds required is compared with the backtracking algorithm and the min-conflicts-hill-climbing algorithm. It is observed that our algorithm takes less CPU time and less number of iterations.

Keywords: constraint satisfaction problems; university timetabling; backtracking algorithm; min-conflicts hill climbing algorithm; backtrack-free algorithm; higher education.

DOI: 10.1504/IJMOR.2014.059537

International Journal of Mathematics in Operational Research, 2014 Vol.6 No.2, pp.236 - 257

Received: 05 Jan 2013
Accepted: 01 Mar 2013

Published online: 28 Jun 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article