Abstract
This paper is concerned with the use of simulated annealing in the solution of the multi-objective examination timetabling problem. The solution method proposed optimizes groups of objectives in different phases. Some decisions from earlier phases may be altered later as long as the solution quality with respect to earlier phases does not deteriorate. However, such limitations may disconnect the solution space, thereby causing optimal or near-optimal solutions to be missed. Three variants of our basic simulated annealing implementation which are designed to overcome this problem are proposed and compared using real university data as well as artificial data sets. The underlying principles and conclusions stemming from the use of this method are generally applicable to many other multi-objective type problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Broder, Final examination scheduling, Commun. ACM 7(1964)494–498.
V. Lotfi and R. Cerveny, A final-exam-scheduling package, J. Oper. Res. Soc. 42(1991)205–216.
T. Arani, M. Karwan and V. Lotfi, A Lagrangian relaxation approach to solve the second phase of the exam scheduling problem, Euro. J. Oper. Res. 34(1988)372–383.
N. Balakrishnan, A. Lucena and R.T. Wong, Scheduling examinations to reduce second-order conflicts, Comp. Oper. Res. 19(1992)353–361.
D. Johnson, Timetabling university examinations, J. Oper Res. Soc. 41(1990)39–47.
H.A. Eiselt and G. Laporte, Combinatorial optimization problems with soft and hard requirements, J. Oper. Res. Soc. 38(1987)785–795.
A. Hertz, Tabu search for large scale timetabling problems, Euro. J. Oper. Res. 54(1991)39–47.
M.W. Carter, A survey of practical applications of examination timetabling by computer, Comp. Oper. Res. 34(1986)193–202.
N. Balakrishnan, Examination scheduling: A computerized application, OMEGA 19(1991)37–41.
M. Chams, A. Hertz and D. de Werra, Some experiments with simulated annealing for coloring graphs, Eur. J. Oper. Res. 32(1987)260–266.
N. Dubois and D. de Werra, EPCOT-an efficient procedure for coloring optimally with tabu search. Comp. Math. Appl. 25(1993)35–45.
K.A. Dowsland, Simulated annealing, in:Modern Heuristic Techniques for Combinatorial Problems, ed. C. Reeves (Blackwell Scientific, 1993).
D. Abramson, Constructing school timetables using simulated annealing: Sequential and parallel algorithms, Manag. Sci. 37(1991)98–113.
D. Abramson and H. Dang, School timetables: A case study using simulated annealing, in:Applied Simulated Annealing, Lecture Notes in Economics and Mathematical Systems, vol. 396 (Springer 1993) pp. 104–124.
P. Dige, C. Lund and H.F. Ravn, Timetabling by simulated annealing, in:Applied Simulated Annealing, Lecture Notes in Economics and Mathematical Systems, vol. 396 (Springer, 1993) pp. 151–174.
M.B. Wright, Scheduling English cricket umpires, J. Oper. Res. Soc. 42(1991)447–452
F. Glover, Tabu search—Part I, ORSA J. Comp. 1(1989)190–206.
C. Morgernstern and H. Shapiro, Chromatic number approximation using simulated annealing, Technical Report CS86-1, Department of Computer Science, University of New Mexico (1989).
S.R. White, Concepts of scale in simulated annealing,Proc. IEEE Int. Conf. on Computer Design (1984) pp. 646–651.
J.M. Thompson and K.A. Dowsland, Multi-objective university examination scheduling, Working Paper No. EBMS/1993/12, EBMS, Swansea University (1993).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Thompson, J.M., Dowsland, K.A. Variants of simulated annealing for the examination timetabling problem. Ann Oper Res 63, 105–128 (1996). https://doi.org/10.1007/BF02601641
Issue Date:
DOI: https://doi.org/10.1007/BF02601641