A tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem

ACM Journal of Experimental Algorithmics

Volumn 10, Issue , 2005, Pages

  Santos, Haroldo G ^a   Ochi, Luiz S ^a   Souza, Marcone J F ^b  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^b FEDERAL UNIVERSITY OF OURO PRETO   (Brazil)

Author keywords

Metaheuristics; Tabu search; Timetabling

Indexed keywords

EID: 84940385342     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/1064546.1180621     Document Type: Article

References (17)

1. ABRAMSON, D. 1991. Constructing school timetables using simulated annealing: sequential and parallel algorithms. Management Science 37, 98-113.
2. AIEX, R. M., RESENDE, M.G.C.,AND RIBEIRO, C. C. 2002. Probability distribuition of solution time in GRASP: an experimental investigation. Journal of Heuristics 8, 343-373.
3. BRESINA, J. 1996. Heuristic-biased stochastic sampling. In AAAI/IAAI, Vol. 1, 271-278.
4. COLORNI, A., DORIGO, M., AND MANIEZZO, V. 1998. Metaheuristics for high-school timetabling. Computational Optimization and Applications 9, 3, 277-298.
5. COSTA, D. 1994. A tabu search algorithm for computing an operational timetable. European Journal of Operational Research Society 76, 98-110.
6. DOWSLAND, K. 1997. Off-the-peg or made to measure: timetabling and scheduling with SA and TS. In Practice and Theory of Automated Timetabling II. Springer-Verlag, New York, 37-52.
7. EVEN, S., ITAI, A., AND SHAMIR, A. 1976. On the complexity of timetabling and multicommodity flow problems. SIAM Journal on Computing 5, 691-703.
8. GENDREAU, M., HERTZ, A., AND LAPORTE, G. 1994. A tabu search heuristic for the vehicle routing problem. Management Science 40, 1276-1290.
9. GLOVER, F. 1986. Future paths for integer programming and artificial intelligence. Computers &Operations Research 13, 533-549.
10. GLOVER, F. AND LAGUNA, M. 1997. Tabu Search. Kluwer Academic Publ., Boston, MA.
11. HANSEN, P. 1986. The steepest ascent mildest descent heuristic for combinatorial programming. In Congress on Numerical Methods in Combinatorial Optimization. Capri.
12. RESENDE, M. AND RIBEIRO, C. 2003. Greedy randomized adaptive search procedures. In Handbook of Metaheuristics. Kluwer Academic Publ., Boston, MA. 219-249.
13. SCHAERF, A. 1999. Local search techniques for large high-school timetabling problems. IEEE Trans. on Systems, Man and Cybernetics 29, 6, 368-377.
14. SOUZA, M. 2000. Timetabling in high-schools:approximation by metaheuristics (in portuguese). Ph.D. thesis, Universidade Federal do Rio de Janeiro, Brazil.
15. SOUZA, M., OCHI, L., AND MACULAN, N. 2003. A GRASP-Tabu search algorithm for solving school timetabling problems. In Metaheuristics: Computer Decision-Making, M. Resende and J. Souza, Eds. Kluwer Academic Publ., Boston, MA, 659-672.
16. SUN, M. 2006. Solving the uncapacitated facility location problem using tabu search. Computers & Operations Research 33, 2563-2589.
17. WILKE, P., GROBNER, M., AND OSTER, N. 2002. A Hybrid Genetic Algorithm for School Timetabling. In AI 2002: Advances in Artificial Intelligence, McKay, B. and Slaney, J., Eds. Springer-Verlag, New York, 455-464.