Abstract
The university course timetabling problem involves assigning a given number of events into a limited number of timeslots and rooms under a given set of constraints; the objective is to satisfy the hard constraints (essential requirements) and minimize the violation of soft constraints (desirable requirements). In this study we employed a Dual-sequence Simulated Annealing (DSA) algorithm as an improvement algorithm. The Round Robin (RR) algorithm is used to control the selection of neighbourhood structures within DSA. The performance of our approach is tested over eleven benchmark datasets. Experimental results show that our approach is able to generate competitive results when compared with other state-of-the-art techniques.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Burke, E.K., Kendall, G., Soubeiga, E.: A tabu search hyperheuristic for timetabling and rostering. Journal of Heuristics 9(6), 451–470 (2003)
Sekhar Pedamallu, C., Özdamar, L.: Comparison of Simulated Annealing. In: Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization. Natural Computing Series. Springer, Heidelberg (2008)
Sekhar Pedamallu, C., Özdamar, L.: Investigating a hybrid simulated annealing and local search algorithm for constrained optimization. In: EJOR (2006) (in press), http://dx.doi.org/0,1016/j.ejor.2006.06.050
Abdullah, S., Burke, E.K., McCollum, B.: An Investigation of Variable Neighbourhood Search for Course Timetabling. In: The Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2005), New York, USA, July 18 -21, pp. 413–427 (2005)
Abdullah, S., Burke, E.K., McCollum, B.: Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for University Course Timetabling. In: Metaheuristics Progress in Complex Systems Optimization, pp. 153–169. Springer, Heidelberg (2007)
Abdullah, S., Burke, E.K., McCollum, B.: A Hybrid Evolutionary Approach to the University Course Timetabling Problem. In: IEEE Congres on Evolutionary Computation, pp. 1764–1768 (2007) ISBN: 1-4244-1340-0
McMullan, P.: An Extended Implementation of the Great Deluge Algorithm for Course Timetabling. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol. 4487, pp. 538–545. Springer, Heidelberg (2007)
Socha, K., Knowles, J., Samples, M.: A max-min ant system for the university course timetabling problem. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, pp. 1–13. Springer, Heidelberg (2002)
Landa-Silva, D., Obit, J.H.: Great Deluge with Nonlinear Decay Rate for Solving Course Timetabling Problems. In: Proceedings of the 2008 IEEE Conference on Intelligent Systems (IS 2008), pp. 8.11–8.18. IEEE Press, Los Alamitos (2008)
Hedar, A.-R., Fukushima, M.: Derivative-free filter simulated annealing method for constrained continuous global optimization. Journal of Global Optimization (2006) (to appear)
Abdullah, S., Turabieh, H.: Generating university course timetable using genetic algorithms and local search. In: The Third 2008 International Conference on Convergence and Hybrid Information Technology ICCIT, vol. I, pp. 254–260 (2008)
Burke, E.K., Petrovic, S.: Recent research directions. Iin automated timetabling. European Journal of Operation Research 140(2), 266–280 (2002)
Lewis, R., Paechter, B., McCollum, B.: Post enrolment based course timetabling: A description of the problem model used for track two of the second international timetabling competition Technical Report, Cardiff University (2007)
Lewis, R.: A survey of metaheuristic based techniques for university timetabling problems. OR Spectrum 30(1), 167–190 (2008)
Qu, R., Burke, E.K., McCollum, B., Merlot, L.T.G.: A survey of search methodologies and automated system development for examination timetabling. Journal of Scheduling 12(1), 55–89 (2009)
Burke, E.K., McCollum, B., Meisels, A., Petrovic, S., Qu, R.: A Graph-Based Hyper Heuristic for Educational Timetabling Problems. European Journal of Operational Research 176(1), 177–192 (2007)
Rossi-Doria, O., Samples, M., Birattari, M., Chiarandini, M., Dorigo, M., Gambardella, L.M., Knowles, J., Manfrin, M., Mastrolilli, M., Paechter, B., Paquete, L., Stützle, T.: A comparison of the performance of different meta-heuristics on the timetabling problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 329–354. Springer, Heidelberg (2003)
Turabieh, H., Abdullah, S., McCollum, B.: Electromagnetism-like Mechanism with Force Decay rate Great Deluge for the Course Timetabling problem. In: Wen, P., Li, Y., Polkowski, L., Yao, Y., Tsumoto, S., Wang, G. (eds.) RSKT 2009. LNCS (LNAI), vol. 5589, pp. 497–504. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abdullah, S., Shaker, K., McCollum, B., McMullan, P. (2010). Dual Sequence Simulated Annealing with Round-Robin Approach for University Course Timetabling. In: Cowling, P., Merz, P. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2010. Lecture Notes in Computer Science, vol 6022. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12139-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-12139-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12138-8
Online ISBN: 978-3-642-12139-5
eBook Packages: Computer ScienceComputer Science (R0)