Enhancing Timetable Solutions with Local Search Methods

  • E. K. Burke
  • J. P. Newall
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2740)


It is well known that domain-specific heuristics can produce good-quality solutions for timetabling problems in a short amount of time. However, they often lack the ability to do any thorough optimisation. In this paper we will study the effects of applying local search techniques to improve good-quality initial solutions generated using a heuristic construction method. While the same rules should apply to any heuristic construction, we use here an adaptive approach to timetabling problems. The focus of the experiments is how parameters to the local search methods affect quality when started on already good solutions. We present experimental results which show that this combined approach produces the best published results on several benchmark problems and we briefly discuss the implications for future work in the area.


Local Search Soft Constraint Hill Climbing Local Search Method Heuristic Construction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Burke, E.K., Bykov, Y., Newall, J.P., Petrovic, S.: An Investigation of Time Pre-defined Search for the Examination Timetabling Problem. Technical Report NOTTCS-TR-2002-1. School of Computer Science and IT, University of Nottingham (2002) Google Scholar
  2. 2.
    Burke, E.K., Elliman, D.G., Ford, P.H., Weare, R.F.: Examination Timetabling in British Universities – a Survey. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 76–90. Springer, Heidelberg (1996)Google Scholar
  3. 3.
    Burke, E.K., Newall, J.P.: A New Adaptive Heuristic Framework for Examination Timetabling Problems. Technical Report NOTTCS-TR-2001-5. School of Computer Science and IT, University of Nottingham (2002) (to appear in Ann. Oper. Res.) Google Scholar
  4. 4.
    Burke, E., Petrovic, S.: Recent Research Directions in Automated Timetabling. Eur. J. Oper. Res. 140, 266–280 (2002)zbMATHCrossRefGoogle Scholar
  5. 5.
    Carter, M.W.: A Survey of Practical Applications of Examination Timetabling. Oper. Res. 34, 193–202 (1986)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Carter, M.W., Laporte, G.: Recent Developments in Practical Examination Timetabling. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 3–21. Springer, Heidelberg (1996)Google Scholar
  7. 7.
    Carter, M.W., Laporte, G., Lee, S.: Examination Timetabling: Algorithmic Strategies and Applications. J. Oper. Res. Soc. 47, 373–383 (1996)Google Scholar
  8. 8.
    Di Gaspero, L., Schaerf, A.: Tabu Search Techniques for Examination Timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 104–117. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  9. 9.
    Dueck, G.: New optimization Heuristics: the Great Deluge and the Record-to- Record Travel. J. Comput. Phys. 104 (1993)Google Scholar
  10. 10.
    Dueck, G., Scheuer, T.: Threshold Accepting: a General Purpose Algorithm Appearing Superior to Simulated Annealing. J. Comput. Phys. 90, 161–175 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220(4598), 671–680 (1983)CrossRefMathSciNetGoogle Scholar
  12. 12.
    White, G.M., Xie, B.S.: Examination Timetables and Tabu Search with Longer- Term Memory. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 85–103. Springer, Heidelberg (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • E. K. Burke
    • 1
  • J. P. Newall
    • 2
  1. 1.School of Computer Science and Information TechnologyUniversity of NottinghamNottinghamUK
  2. 2.eventMAP LtdBelfast

Personalised recommendations