Metaheuristics for high school timetabling

Computational Optimization and Applications

Volumn 9, Issue 3, 1998, Pages 275-298

  Colorni, Alberto ^a   Dorigo, Marco ^b   Maniezzo, Vittorio ^c  

^a POLITECNICO DI MILANO   (Italy)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Genetic algorithms; Simulated annealing; Tabu search; Timetable problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; CURRICULA; DECISION TABLES; GENETIC ALGORITHMS; MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES; PROBLEM SOLVING; SIMULATED ANNEALING; COMBINATORIAL MATHEMATICS; COMPUTER SIMULATION; HEURISTIC PROGRAMMING; HIERARCHICAL SYSTEMS; OPTIMIZATION;

METAHEURISTICS; REAL-WORLD APPLICATIONS; TABU SEARCH; TIMETABLE PROBLEM;

HEURISTIC METHODS; ANNEALING;

EID: 0032023328     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1018354324992     Document Type: Article

References (31)

1. A. Abramson, "Constructing school timetables using simulated annealing: Sequential and parallel algorithms," Management Science, vol. 37, pp. 98-113, 1991.
2. E.A. Akkonyunlu, "A linear algorithm for computing the optimum of university timetable," Computer Journal, vol. 16, pp. 347-350, 973.
3. E.K. Burke, J.P. Newall, and R.F. Weare, "A memetic algorithm for university exam timetabling," in Proc. of ICPTAT'95, 1st Int. Conf. on the Practice and Theory of Automated Timetabling, Napier University, Edinburgh, UK, 1995, pp. 496-503.
4. M. W. Carter, "A survey of practical applications of examination timetabling algorithms," Operations Research, vol. 34, pp. 193-202, 1986.
5. N. Chahal and D. De Werra, "An interactive system for constructing timetables on a PC," European Journal of Operational Research, vol. 40, pp. 32-37, 1989.
6. A. Colorni, M. Dorigo, and V. Maniezzo, Genetic algorithms: A New Approach to the Timetable Problem, NATO ASI Series, Springer-Verlag, 1990, vol. F82, pp. 235-239.
7. D. Costa, "A tabu search algorithm for computing an operational timetable," European Journal of Operational Research, vol. 57, pp. 98-110, 1994.
8. G.A. Croes, "A method for solving traveling salesman problems," Operations Research, vol. 6, pp. 791-812, 1958.
9. J. Csima and C.C. Gotleib, "Tests on a computer method for construction of school timetables," Communications of the ACM, vol. 7, pp. 160-163, 1961.
10. D. de Werra, "An introduction to timetabling," European Journal of Operational Research, vol. 19, pp. 151-162, 1985.
11. W. Erben and J. Keppler, "A genetic algorithm solving a weekly course-timetabling problem," in Proc. of ICPTAT'95, 1st Int. Conf. on the Practice and Theory of Automated Timetabling, Napier University, Edinburgh, UK, 1995, pp. 21-32.
12. S. Even, A. Itai, and A. Shamir, "On the complexity of timetable and multicommodity flow problems," SIAM Journal of Computing, vol. 5, no. 4, pp. 691-703, 1976.
13. J.A. Ferland and S. Roy, "Timetabling problem for university as assignment of activities to resources," Computers and Operations Research, vol. 12, pp. 207-218, 1985.
14. P. Gianoglio, "Application of neural networks to timetable construction," in Proc. of the Third Int. Workshop on Neural Networks and Their Applications.
15. F. Glover, "Tabu search-Part I," ORSA J. on Computing, vol. 1, pp. 190-206, 1989.
16. F. Glover, "Tabu search-Part II," ORSA J. on Computing, vol. 2, pp. 4-32, 1990.
17. A. Hertz, "Finding a feasible course schedule using tabu search," Discrete Applied Mathematics, vol. 35, pp. 255-270, 1992.
18. A. Hertz, "Tabu search for large scale timetabling problems," European Journal of Operational Research, vol. 54, pp. 39-47, 1992.
19. J.H. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan Press: Ann Arbor, Michigan, 1975. Reprinted by MIT Press, 1992.
20. W. Junginger, "Course scheduling by genetic algorithms," in Evolutionary Algorithms in Management Applications, J. Biethahn and V. Niessen (Eds.), Springer Verlag, 1995, pp. 357-370.
21. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, 1983.
22. N.H. Lawrie, "An integer programming model for a school timetabling problem," Computer Journal, vol. 12, pp. 307-316, 1969.
23. V. Maniezzo, A. Colorni, and M. Dorigo, "Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem," European Journal of Operational Research, vol. 81 no. l, pp. 188-205, 1995.
24. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller, "Equation of state calculations by fast computing machines," J. of Chemical Physics, vol. 21, pp. 1087-1092, 1953.
25. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer Verlag, 1992.
26. P. Moscato, "An introduction to population approaches for optimization and hierarchical objective functions: Discussion on the role of tabu search," Annals of Operations Research, vol. 41, pp. 85-121, 1993.
27. H. Muhlenbein, "Parallel genetic algorithms, population genetics and combinatorial optimization, in Proc. of the Third Int. Conf. on Genetic Algorithms, Morgan Kaufmann, 1989, pp. 124-129.
28. J.M. Mulvey, "A classroom/time assignment model," European Journal of Operational Research, vol. 9, pp. 64-70, 1982.
29. D.C. Rich, "A smart genetic algorithm for university timetabling," in Proc. of ICPTAT'95, 1st Int. Conf. on the Practice and Theory of Automated Timetabling, Napier University, Edinburgh, UK, 1995, pp. 202-216.
30. A. Schaerf and M. Schaerf, "Local search techniques for high school timetabling," in Proc. of ICPTAT'95, 1st Int. Conf. on the Practice and Theory of Automated Timetabling, Napier University, Edinburgh, UK, 1995.
31. E. Taillard, "Robust taboo search for the quadratic assignment problem," Report ORPW 90/10, DMA, Swiss Federal Institute of Technology of Lausanne, 1990.