Simulated annealing cooling schedules for the school timetabling problem

Asia-Pacific Journal of Operational Research

Volumn 16, Issue 1, 1999, Pages 1-22

  Abramson, David ^a,b,c,d,e,f   Krishnamoorthy, Mohan ^b   Dang, Henry ^c  

^a GRIFFITH UNIVERSITY   (Australia)

^b CSIRO   (Australia)

^c RMIT UNIVERSITY   (Australia)

^d MONASH UNIVERSITY   (Australia)

^e RMIT ^*

^f Sch of Comp Science and Software

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; PROBLEM SOLVING; SCHEDULING; SIMULATED ANNEALING;

TIMETABLING PROBLEM;

OPERATIONS RESEARCH;

EID: 0032595706     PISSN: 02175959     EISSN: None     Source Type: None    
DOI: None     Document Type: Article

References (53)

1. Aarts, E. H. L. and J. Korst (1989), Simulated Annealing and Boltzmann Machines, John Wiley.
2. Aarts, E. H. L., F. M. J. de Bont, J. H. A. Habers and P. J. M. van Laarhoven (1986a), A parallel statistical cooling algorithm, Proceedings of STACS 86, Springer Lecture Notes in Computer Science 210, 87-97.
3. Aarts, E. H. L., F. M. J. de Bont, J. H. A. Habers and P. J. M. van Laarhoven (1986b), Parallel implementations of the statistical cooling algorithm, Integration 4, 209-238.
4. Abramson, D. A. (1991), Constructing school timetables using simulated annealing: Sequential and parallel algorithms, Management Science 37 (1), 98-113.
5. Abramson, D. A. (1992), A very high speed architecture to support simulaed annealing, IEEE Computer.
6. Abramson, D. A. and H. Dang (1993), School timetables: A case study in simulated annealing. In Rene V. V. Vidal, ed.: Lecture Notes in Economics and Mathematical Systems: Applied Simulated Annealing, 103-124.
7. Abramson, D. A., H. Dang and M. Krishnamoorthy (1996), A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm, Annals of Operations Research 63, 129-150.
8. Akkoyunulu, E. A. (1973), A linear algorithm for computing the optimum university timetable, Computer Journal 16 (4), 347-350.
9. Aust, R. J. (1976), An improvement algorithm for school timetabling, Computer Journal 8, 135-146.
10. Bonomi, E. and J. L. Lutton (1984a), The N-city travelling salesman problem: statistical mechanics and the metropolis algorithm, SIAM Review 26, 551-568.
11. Bonomi E. and J. L. Lutton (1984b), The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach, European Journal of Operational Research.
12. Bonomi, E. and J. L. Lutton (1984c), Simulated annealing algorithm for the minimum weighted perfect Euclidean matching problem, R.A.I.R.O Recherche Operationelle 20, 177-182.
13. Britton, J. N. G. and F. J. M. Forest (1971), College timetable construction by computer, Computer Journal 14, 361-365.
14. Casolta, A., F. Romeo and A. L. Sangiovanni-Vincentelli (1986), A parallel simulated annealing algorithm for the replacement of marco-cells, Proceedings of IEEE International Conference on Computer Aided Design, Santa-Clara.
15. Cerny, V. (1983), Multiprocessor systems as a statistical ensemble: A way towards general purpose parallel processing and MIMD computers, Comenius University, Bratislava, unpublished manuscript.
16. Chyan, D. J. and M. A. Breuer (1983), A placement algorithm for array processors, Proceedings of 20th Design Automation Conference, Miami Beach, 182-188.
17. Collins, N. E., R. W. Eglese and B. L. Golden (1988), Simulated annealing: An annotated bibliography, American Journal of Mathematical and Management Sciences 8 (3-4), 209-307.
18. Connolly, D. (1990), An improved annealing scheme for the quadratic assignment problem, European Journal of Operational Research 46, 93-100.
19. Connolly, D. (1992), General purpose simulated annealing, Journal of the Operational Research Society 43, 494-505.
20. Costa, D. (1994), A Tabu search algorithm for computing an operational timetable, European Journal of Operational Research 76, 89-110.
21. Dempster, M. A. H. (1971), Two algorithms for the timetabling problem. In D. J. A. Welsh, ed.: Combinatorial Mathematics and Its Applications, Academic Press, New York, 63-85.
22. De Gans, O. B. (1981), A computer timetabling system for secondary schools in the Netherlands, European Journal of Operational Research 7, 175-182.
23. De Werra, D. (1971), Construction of school timetables by flow method, INFOR 9, 12-22.
24. De Werra, D. (1978), Notes - Some comments on a note about timetabling, INFOR 16, 90-92.
25. Eglese, R. W. (1990), Simulated annealing: A tool for Operational Research, European Journal of Operational Research 46, 271-281.
26. Gidas, B. (1988), Nonstationary Markov chains and convergence of the annealing algorithm, Journal of Statistical Physics 39, 73-131.
27. Hajeck, B. (1988), Cooling schedule for optimal annealing, Mathematics of Operations Research 13, 311-329.
28. Hertz, A. (1991), Tabu search for large scale timetabling problems, European Journal of Operational Research 54, 39-47.
29. Hertz, A. (1992), Finding a feasible course schedule with Tabu search, Discrete Applied Mathematics 35, 255-270.
30. Ingber, L. (1991), Very fast simulated re-annealing, Mathematical and Computer Modelling 15, 77-78.
31. Ingber, L. and B. Rosen (1992), Genetic algorithms and very fast simulated re-annealing: A comparison, Mathematical and Computer Modelling 16 (11), 87-100.
32. Johnson, D. S., C. R. Aragon, L. A. McGeoch and C. Schevon (1986), Optimization by simulated annealing: An experimental evaluation, List of Abstracts, Workshop on Statistical Physics in Engineering and Biology, Yorktown Heights.
33. Kang Le, P. Belanger, G. White and G. Con Schoenberg (1991), Computerized scheduling, Proceedings of 36th Annual College and University Users Conference, Louisville, Kentucky.
34. Kirkpatrick, S., C. D. Gelatt Jr. and M. P. Vecchi (1993a), Optimization by simulated annealing, IBM Research Report RC 9355.
35. Kirkpatrick, S., C. D. Gelatt Jr. and M. P. Vecchi (1993b), Optimization by simulated annealing, Science 220, 671-680.
36. Koulamas, C., S. R. Antony and R. Jaen (1994), A survey of simulated annealing applications to Operations Research problems, Omega 22 (1), 41-56.
37. Leong, H. W. and C. L. Liu (1985), Permutation channel routing, Proceedings of IEEE International Conference on Computer Design, Port Chester, 579-584.
38. Lister, R. (1993), Annealing networks and fractal landscapes, Proceedings of IEEE International Conference on Neutral Networks, Volume 1, San Francisco, 257-262.
39. Lundy, M. and A. Mees (1986), Convergence of an annealing algorithm, Mathematical Programming 34, 111-124.
40. McDiarmid, C. J. H. (1972), The solution of a timetabling problem, J. Inst. Math. Appl. 9, 23-34.
41. Metropolis, N., A. Rosenbluth, M. Rosenbluth, A. Teller and E. Teller (1953), Equation of state calculations by fast computing machines, Journal of Chemical Physics 21, 1087-1092.
42. Morgenstern, C. A. and H. D. Shapiro (1986), Chromatic number approximation using simulated annealing, Technical Report No. CS86-1, Department of Computer Science, University of Mexico, Alberquerque.
43. Osman, I. H. and N. Christofides (1994), Capacitated clustering problems by hybrid simulated annealing and Tabu search, International Transactions in Operational Research 1 (3), 317-326.
44. Osman, I. H. (1995), Heuristics for the generalized assignment problem: Simulated annealing and Tabu search approaches, OR Spektrum 17, 211-225.
45. Osman, I. H. (1993), Metastrategy simulated annealing and Tabu search algorithms for the vehicle routing problem, Annals of Operations Research 41, 421-451.
46. Osman, I. H. and G. Laporte (1996), Metaheuristics: A bibliography, Annals of Operations Research 63, 513-623.
47. Romeo, F. and A. L. Sangiovanni-Vincentelli (1991), A theoretical framework for simulated annealing, Algorithmica 6, 346-366.
48. Sechen, C. and A. L. Sangiovanni-Vincentelli (1985), The timber wolf placement and routing package, IEEE Journal on Solid State Circuits SC-20, 510-522.
49. Tripathy, A. (1984), School timetabling - A case in large binary integer linear programming, Management Science 30 (12), 1473-1489.
50. Ulph, A. (1977), Notes - An extension of a result in school timetabling, INFOR 15, 255-257.
51. van Laarhoven, P. J. M. and E. H. L. Aarts (1987), Simulated Annealing: Theory and Applications, Reidel, The Netherlands.
52. White, D. J. (1976), A note on faculty timetabling, Operations Research Quarterly 26, 875-878.
53. White, S. R. (1984), Concepts of scale in simulated annealing, Proceedings of IEEE International Conference on Computer Design, Port Chester, 646-651.