A new approach for university timetabling problems Online publication date: Sat, 28-Jun-2014
by Rakesh P. Badoni; D.K. Gupta; Anil K. Lenka
International Journal of Mathematics in Operational Research (IJMOR), Vol. 6, No. 2, 2014
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook