Advertisement

General cooling schedules for a simulated annealing based timetabling system

  • Jonathan Thompson
  • Kathryn A Dowsland
Tabu Search and Simulated Annealing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1153)

Abstract

The precise nature of the examination timetabling problem differs from institution to institution. Thus any general solution method must be suitably flexible and this paper is concerned with finding robust cooling schedules for a simulated annealing based approach. The motivation is TISSUE, a timetabling package developed and used successfully at Swansea University. Previous work has concentrated on the problem specific decisions, and with very slow cooling, TISSUE performs well on a variety of real life test data. Here, we concentrate on automating the cooling schedule with the objective of improving running times without sacrificing solution quality. The results of extensive tests on a variety of data sets demonstrated that adaptive schedules were flexible enough to produce high quality solutions with a reduction in solution time.

Keywords

Timetabling simulated annealing cooling schedule 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kirkpatrick, S., Gelatt, C. and Vecchi, P.: Optimization by simulated annealing. Science 220 (1983), 671–679.Google Scholar
  2. 2.
    Thompson, J.: A survey of the examination timetabling problem at British universities. Internal Report, European Business Management School, University of Wales Swansea (1995).Google Scholar
  3. 3.
    Loughlin, B.: Private communication.Google Scholar
  4. 4.
    Dowsland, K. A.: Simulated annealing solutions for multi-objective scheduling and timetabling. Proc. ADT95, Modern Heuristic Search Methods, UNICOM Seminars, Brunel (1995), 205–220.Google Scholar
  5. 5.
    Chams, M., Hertz, A. and de Werra, D.: Some experiments with simulated annealing for coloring graphs. EJOR 32 (1987), 260–266.Google Scholar
  6. 6.
    Morgenstern, C. and Shapiro, H.: Chromatic number approximation using simulated annealing. Technical Report CS86-1, Department of Computer Science, University of New Mexico (1989).Google Scholar
  7. 7.
    Balakrishnan, N.: Examination scheduling: A computerized application. OMEGA 19, (1991), 37–41.Google Scholar
  8. 8.
    Thompson, J. and Dowsland, K. A.: Variants of Simulated Annealing for the Examination Timetabling Problem. To appear in Annals of OR.Google Scholar
  9. 9.
    Jeffcoat D. E. and Bulfin, R. L.: Simulated annealing for resource-constrained scheduling. EJOR 70 (1993), 43–51.Google Scholar
  10. 10.
    Kuik, R. and Salomon, M.: Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic. EJOR 45 (1990), pp. 25–37.Google Scholar
  11. 11.
    White, S. R.: Concepts of scale in simulated annealing. Proc. of IEEE international conference on computer design (1984), 646–651.Google Scholar
  12. 12.
    Abramson, D.: Constructing school timetables using simulated annealing: sequential and parallel algorithms. Man. Sci. 37, (1991), 98–113.Google Scholar
  13. 13.
    Lundy, M. and Mees, A.: Convergence of an annealing algorithm. Mathematical programming 34 (1986), 111–124.Google Scholar
  14. 14.
    Johnson, D.S., Aragon, C. R., McGeoch, L. A. and Schevon, C.: Optimization by simulated annealing: An experimental evaluation; part II, graph coloring and number partitioning. Operations research 39, (1991), 378–406.Google Scholar
  15. 15.
    Hajek, B.: Cooling schedules for optimal annealing. Mathematics of OR 13 (1988), 311–329.Google Scholar
  16. 16.
    Anderson, K., Vidal, R.V.V. and Iverson, V. B.: Design of a teleprocessing communication network using simulated annealing. Lecture notes in Economics & Mathematical Systems 396 (Ed. R. V. V. Vidal). (1993) 201–216.Google Scholar
  17. 17.
    Huang, M. D., Romeo, F. and Sangiovanni-Vincentelli, A.: An efficient general cooling schedule for simulated annealing. Proceedings of the IEEE International conference on Computer Aided Design, Santa Clara (1986), 381–384.Google Scholar
  18. 18.
    Connolly, D. T.: An improved annealing scheme for the QAP. EJOR 46 (1990), 93–100.Google Scholar
  19. 19.
    Dowsland, K. A.: Some experiments with simulated annealing techniques for packing problems. EJOR 68, (1993b), 389–399.Google Scholar
  20. 20.
    Walsh, P. A. and Miller, D. M.: Goal-directed simulated annealing and simulated sintering. Microelectronics Journal 25, (1994), 363–382.Google Scholar
  21. 21.
    Li, Y. H. and Jiang, Y. J.: Localized simulated annealing in constraint satisfaction and optimization. Proc. ADT95, Modern Heuristic Search Methods, UNICOM Seminars, Brunei (1995), 221–230.Google Scholar
  22. 22.
    Mirkin, G., Vasudevan, K. and Cook, F. A.: A comparison of several cooling schedules for simulated annealing implemented on a residual statics problem. Geophysical research letters 20, (1993), 77–80.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Jonathan Thompson
    • 1
  • Kathryn A Dowsland
    • 1
  1. 1.European Business Management SchoolUniversity of Wales SwanseaSwanseaUK

Personalised recommendations