Computational study of non-linear great deluge for university course timetabling

Obit, Joe Henry; Landa-Silva, Dario

Abstract

The great deluge algorithm explores neighbouring solutions which are accepted if they are better than the best solution so far or if the detriment in quality is no larger than the current water level. In the original great deluge method, the water level decreases steadily in a linear fashion. In this paper,we conduct a computational study of a modified version of the great deluge algorithm in which the decay rate of the water level is non-linear. For this study, we apply the non-linear great deluge algorithm to difficult instances of the university course timetabling problem. The results presented here show that this algorithm performs very well compared to other methods proposed in the literature for this problem. More importantly, this paper aims to better understant the role of the non-linear decay rate on the behaviour of the non-linear great deluge approach.

Citation

Obit, J. H., & Landa-Silva, D. (2010). Computational study of non-linear great deluge for university course timetabling. In V. Sgurev, M. Hadjiski, & J. Kacprzyk (Eds.), Intelligent systems: from theory to practice. Springer

• Acceptance Date: Jul 1, 2010
• Publication Date: Sep 1, 2010
• Deposit Date: Aug 1, 2016
• Peer Reviewed: Peer Reviewed
• Issue: 299
• Series Title: Studies in computational intelligence
• Book Title: Intelligent systems: from theory to practice
• ISBN: 978-3-642-13428-9
• Keywords: Course Timetabling, Scheduling and Timetabling, Great Deluge, Hybrid Metaheuristics
• Public URL: https://nottingham-repository.worktribe.com/output/1011786
• Publisher URL: http://link.springer.com/chapter/10.1007%2F978-3-642-13428-9_14
• Additional Information: Note: Presented at the 2008 International Conference on Intelligent Systems (IEEE-IS 2008), Varna Bulgaria, September 2008.