Abstract
The examination scheduling problem has been examined and a four-phase system using a tabu search algorithm, OTTABU, has been implemented. This system uses both recency-based short-term memory and move (or frequency)-based longer-term memory to improve the quality of the solutions found. The system was tested using real data obtained from the University of Ottawa registrar’s office and real examination schedules were produced. It was found that the use of longer-term memory produced better schedules that those produced without such memory — typically a 34% improvement was obtained due to this factor alone. The length of the long term memory list was also found to be important. A length that is too small can greatly reduce its effectiveness. A list that is too long only reduces the effectiveness by a small amount. A quantitative analysis method is applied to estimate the appropriate length of the longer-term tabu list and a controlled tabu relaxation technique is used to improve the effectiveness.
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
Peck, J.E.L., Williams, M.R.: Algorithm 286-Examination Scheduling. Commun. A.C.M. 9 (1966) 433–434
White, G.M. Chan, P.-W.: Towards the Construction of Optimal Examination Schedules. INFOR 17 (1979) 219–229
Carter, M.W., Laporte, G., Chinneck, J.W.: A General Examination Scheduling System. Interfaces 24 (1994) 109–120
Carter, M.W., Laporte, G.: Recent Developements in Practical Examination Timetabling. Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 3–21
de Werra, D., Hertz, A.: Tabu Search Techniques-a Tutorial and Applications to Neural Networks. OR Spektrum 11 (1989) 131–141
Hertz, A.: Tabu Search for Large Scale Timetabling Problems. Eur. J. Oper. Res. 54 (1991) 39–47
Boufflet, J.P., Negre, S.: Three Methods Used to Solve an Examination Timetable Problem. Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 3–21
Ferland, J.A.: Generalized Assignment-Type Problems: a Powerful Model Scheme. Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1998) 53–77
Glover, F: Tabu Search: a Tutorial. Interfaces 20 (1990) 74–94
Glover, F., Laguna, M.: Tabu Search. Kluwer, Dordrecht (1997)
Carter, M.W., Laporte, G., Lee, S.Y.: Examination Timetabling: Algorithmic Strategies and Applications. J. Oper. Res. Soc. 47 (1996) 373–383
Di Gaspero, L., Schaerf, A.: Proc. 3rd Int. Conf. Practice and Theory of Automated Timetabling (Konstanz, Germany) (2000) 176–179
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
White, G.M., Xie, B.S. (2001). Examination Timetables and Tabu Search with Longer-Term Memory. In: Burke, E., Erben, W. (eds) Practice and Theory of Automated Timetabling III. PATAT 2000. Lecture Notes in Computer Science, vol 2079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44629-X_6
Download citation
DOI: https://doi.org/10.1007/3-540-44629-X_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42421-5
Online ISBN: 978-3-540-44629-3
eBook Packages: Springer Book Archive