Abstract
The course timetabling problem deals with the assignment of a set of courses to specific timeslots and rooms within a working week subject to a variety of hard and soft constraints. Solutions which satisfy the hard constraints are called feasible. The goal is to satisfy as many of the soft constraints as possible whilst constructing a feasible schedule. In this paper, we present a composite neighbourhood structure with a randomised iterative improvement algorithm. This algorithm always accepts an improved solution and a worse solution is accepted with a certain probability. The algorithm is tested over eleven benchmark datasets (representing one large, five medium and five small problems). The results demonstrate that our approach is able to produce solutions that have lower penalty on all the small problems and two of the medium problems when compared against other techniques from the literature. However, in the case of the medium problems, this is at the expense of significantly increased computational time.
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.
References
Abdullah S, Burke EK and McCollum B (2005a) An investigation of variable neighbourhood search for university course timetabling. In: Proceedings of The 2 nd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2005), New York, USA, July 18th-21st, pp 413-427.
Abdullah S, Burke EK and McCollum B (2005b). Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for University Course Timetabling. In: Proceedings of the 6th Metaheuristics International Conference (MIC 05), Vienna, Austria, August 22nd-26th, in CD-ROM, 2005.
Avella P and Vasil’Ev I (2005) A Computational Study of a Cutting Plane Algorithm for University Course Timetabling. Journal of Scheduling 8(6), pp 497-514.
Ayob M and Kendall G (2003) A monte carlo hyper-heuristic to optimise component placement sequencing for multi head placement machine. Proceedings of the International Conference on Intelligent Technologies, InTech’03, Thailand, Dec 17th -19th, pp 132-141.
Bardadym VA (1996) Computer-aided school and university timetabling: A new wave. Practice and Theory of Automated Timetabling V (eds. Burke and Ross), Springer Lecture Notes in Computer Science Volume 1153, pp 22-45.
Bilge Ü, Kiraç F, Kurtulan M and Pekgün P (2004) A tabu search algorithm for the parallel machine total tardiness problem. Computers & Operations Research 31(3), pp 397-414.
Burke EK, Jackson KS, Kingston JH and Weare RF (1997) Automated timetabling: The state of the art, The Computer Journal 40(9), pp 565-571.
Burke EK and Petrovic S (2002) Recent research direction in automated timetabling. European Journal of Operational Research 140, pp 266-280.
Burke EK, Kendall G and Soubeiga E (2003a) A tabu search hyperheuristic for timetabling and rostering. Journal of Heuristics 9(6), pp 451-470.
Burke EK, Bykov Y, Newall J and Petrovic S (2003b) A Time-Predefined Approach to Course Timetabling, Yugoslav Journal of Operational Research (YUJOR), Vol 13, No. 2, pp 139-151.
Burke, EK, Kingston J and De Werra D (2004) Applications to Timetabling, in the Handbook of Graph Theory, (eds. Gross J and Yellen J), Chapman Hall/CRC Press, pp 445-474,
Burke, E.K., McCollum, B., Meisels, A., Petrovic, S. and Qu, R., A Graph-Based Hyper Heuristic for Educational Timetabling Problems, European Journal of Operational Research 176(1), 1 January 2007, pp 177-192.
Carter MW (2001) Timetabling, encyclopedia of operations research and management science (eds Gass and Harris), Kluwer, pp 833-836.
Carter MW and Laporte G (1998) Recent developments in practical course timetabling. Practice and Theory of Automated Timetabling V (eds. Burke and Carter), Springer Lecture Notes in Computer Science Volume 1408, pp 3-19.
Chiarandini M, Birattari M, Socha K and Rossi-Doria O (2006) An effective hybrid algorithm for university course timetabling. Journal of Scheduling 9(5), pp 403-432.
Daskalaki S, Birbas T and Housos H (2004) An integer programming formulation for a case study in university timetabling. European Journal of Operational Research 153(1), pp 117-135.
Dimopoulou M and Miliotis P (2004) An automated university course timetabling system developed in a distributed environment: A case study. European Journal of Operational Research 153(1), pp 136-147.
de Werra D (1985) An introduction to timetabling. European Journal of Operational Research19, pp 151-162.
Di Gaspero L and Schaerf A (2006) Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modeling and Algorithms, 5(1), pp 65-89.
Gopalakrishnan M, Ahire SL and Miller DM (1997) Maximising the effectiveness of a preventive maintenance system: An adaptive modeling approach. Management Science, 43(6), pp 827-840.
Gopalakrishnan M, Mohan S and He Z. (2001). A tabu search heuristic for preventive maintenance scheduling. Computers & Industrial Engineering, 40, pp 149-160.
Grabowski J and Pempera J (2000) Sequencing of jobs in some production system: Theory and methodology. European Journal of Operational Research, 125, pp 535-550.
Kostuch P (2005) The university course timetabling problem with a three-phase approach. Practice and Theory of Automated Timetabling V (eds. Burke and Trick), Springer Lecture Notes in Computer Science Volume 3616, pp 109-125.
Kostuch P and Socha K (2004), Hardness Prediction for the University Course Timetabling Problem, Proceedings of the Evolutionary Computation in Combinatorial Optimization (EvoCOP 2004), Coimbra, Portugal, April 5-7, 2004, Springer Lecture Notes in Computer Science Volume 3004, pp 135-144.
Landa Silva JD (2003) Metaheuristic and Multiobjective Approaches for Space Allocation. PhD Thesis, Department of Computer Science, University of Nottingham, United Kingdom.
Lewis R and Paechter B (2004) New crossover operators for timetabling with evolutionary algorithms. Proceedings of the5th International Conference on Recent Advances in Soft Computing (ed. Lotfi), UK, December 16th -18th, pp 189-194.
Lewis R and Paechter B (2005) Application of the groping genetic algorithm to university course timetabling. Evolutionary Computation in Combinatorial Optimisation (eds. Raidl and Gottlieb), Springer Lecture Notes in Computer Science Volume 3448, pp 144-153.
Liaw CF (2003) An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. Computers&Operations Research 30(14), pp 2081-2095.
Ouelhadj D (2003) A multi-agent system for the integrated dynamic scheduling of steel production. PhD Thesis, Department of Computer Science, University of Nottingham, United Kingdom.
Petrovic S and Burke EK (2004) University timetabling, Ch. 45 in the Handbook of Scheduling: Algorithms, Models, and Performance Analysis (eds. J. Leung), Chapman Hall/CRC Press.
Rossi-Doria O, Samples M, Birattari M, Chiarandini M, Dorigo M, Gambardella LM, Knowles J, Manfrin M, Mastrolilli M, Paechter B, Paquete L and Stützle T (2003). A comparison of the performance of different meta-heuristics on the timetabling problem. Practice and Theory of Automated Timetabling V (eds. Burke and De Causmaecker), Springer Lecture Notes in Computer Science Volume 2740, pp 329-354.
Santiago-Mozos R, Salcedo-Sanz S, DePrado-Cumplido M, Carlos Bousoalz C. A two-phase heuristic evolutionary algorithm for personalising course timetables: A case study in a Spanish university. Computers and Operations Research 32, pp 1761-1776.
Schaerf A (1999) A survey of automated timetabling. Artificial Intelligence Review 13(2), pp 87-127.
Socha K, Knowles J and Samples M (2002) A max-min ant system for the university course timetabling problem. Proceedings of the 3 rd International Workshop on Ant Algorithms (ANTS 2002), Springer Lecture Notes in Computer Science Volume 2463, pp 1-13.
Socha K, Sampels M and Manfrin M (2003) Ant algorithms for the university course timetabling problem with regard to the state-of-the-art. Proceedings of 3rd European Workshop on Evolutionary Computation in Combinatorial Optimization (EvoCOP’2003), UK, April 14th-16th, Springer Lecture Notes in Computer Science Volume 2611, pp 335-345.
Thompson J and Dowsland K (1996) Various of simulated annealing for the examination timetabling problem. Annals of Operational Research 63, pp 105-128.
Wren A (1996) Scheduling, timetabling and rostering – A special relationship? Practice and Theory of Automated Timetabling V (eds. Burke and Ross), Springer Lecture Notes in Computer Science Volume 1153, pp 46-75.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Abdullah, S., Burke, E.K., McCollum, B. (2007). Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem. In: Doerner, K.F., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R.F., Reimann, M. (eds) Metaheuristics. Operations Research/Computer Science Interfaces Series, vol 39. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-71921-4_8
Download citation
DOI: https://doi.org/10.1007/978-0-387-71921-4_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-71919-1
Online ISBN: 978-0-387-71921-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)