A GRASP strategy for a more constrained School Timetabling Problem

International Journal of Operational Research

Volumn 7, Issue 2, 2010, Pages 152-170

  Moura, Arnaldo Vieira ^a   Scaraficci, Rafael Augusto ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Combinatorial optimisation; GRASP; Greedy Randomized Adaptive Search Procedure; Local search; Meta heuristic; Path relinking; School Timetabling Problem; STP

Indexed keywords

EID: 77951262908     PISSN: 17457645     EISSN: 17457653     Source Type: Journal    
DOI: 10.1504/IJOR.2010.030801     Document Type: Article

References (22)

1. Aiex, R.M., Binato, S. and Resende, M.G.C. (2003) 'Parallel grasp with path-relinking for job shop scheduling', Parallel Computing, Vol.29, pp.393-430.
2. Aiex, R.M., Resende, M.G.C. and Ribeiro, C.C. (2002) 'Probability distribution of solution time in grasp: an experimental investigation', Journal of Heuristics, Vol.8, pp.343-373.
3. Aiex, R.M., Resende, M.G.C., Pardalos, P.M. and Toraldo, G. (2005) 'Grasp with path relinking for three-index assignment', INFORMS Journal on Computing, Vol.17, pp.224-247. (Pubitemid 40891131)
4. Avella, P., D'Auria, B., Salerno, S. and Vasil'Ev, I. (2007) 'A computational study of local search algorithms for Italian high-school timetabling', Journal of Heuristics, Vol.13, pp.543-556. (Pubitemid 350096283)
5. Burke, E.K. and Carter, M.W. (Eds) (1998) Practice and Theory of Automated Timetabling II, Second International Conference, PATAT'97, Toronto, Canada, August 20-22, 1997, Selected Papers, Vol.1408 of Lecture Notes in Computer Science, Springer.
6. Burke, E.K. and Causmaecker, P.D. (Eds) (2003) Practice and Theory of Automated Timetabling IV, 4th International Conference, PATAT 2002, Gent, Belgium, August 21-23, 2002, Selected Revised Papers, Vol.2740 of Lecture Notes in Computer Science, Springer.
7. Burke, E.K. and Erben, W. (Eds) (2001) Practice and Theory of Automated Timetabling III, Third International Conference, PATAT 2000, Konstanz, Germany, August 16-18, 2000, Selected Papers, Vol.2079 of Lecture Notes in Computer Science, Springer.
8. Burke, E.K. and Ross, P. (Eds) (1996) Practice and Theory of Automated Timetabling, First International Conference, Edinburgh, UK, August 29, September 1, 1995, Selected Papers, Vol.1153 of Lecture Notes in Computer Science, Springer.
9. Burke, E.K. and Rudova, H. (Eds) (2007) Practice and Theory of Automated Timetabling VI, 6th International Conference, PATAT 2006, Brno, Czech Republic, August 30, September 1, 2006, Revised Selected Papers, Vol.3867 of Lecture Notes in Computer Science, Springer.
10. Burke, E.K. and Trick, M.A. (Eds) (2005) Practice and Theory of Automated Timetabling V, 5th International Conference, PATAT 2004, Pittsburgh, PA, USA, August 18-20, 2004, Revised Selected Papers, Vol.3616 of Lecture Notes in Computer Science, Springer.
11. Ciscon, L.A., de Oliveira, H.C.B., Andrade, M.C.A., Alvarenga, G.B. and Esmin, A.A.A. (2006) 'The school timetabling problem: a focus on elimination of open periods and isolated classes', HIS '06: Paper presented in the Proceedings of the Sixth International Conference on Hybrid Intelligent Systems, IEEE Computer Society, pp.70-73, Washington, DC, USA.
12. Colorni, A., Dorigo, M. and Maniezzo, V. (1998) 'Metaheuristics for high-school timetabling', Computational Optimization and Applications, Vol.9, pp.277-298.
13. Even, S., Itai, A. and Shamir, A. (1976) 'On the complexity to timetable and multicommodity flow problems', SIAM Journal of Computing, Vol.5, pp.207-218.
14. Glover, F. (1996) 'Tabu search and adaptive memory programming - advances, applications and challenges', Interfaces in Computer Science and Operations Research (pp.1-75). Hingham, MA: Kluwer Academic Publishers.
15. Laguna, M. and Marti, R. (1999) 'GRASP and path relinking for 2-layer straight line crossing minimization', INFORMS Journal on Computing, Vol.11, pp.44-52.
16. Resende, M. (2001) 'Greedy randomized adaptive search procedures (GRASP)', Encyclopedia of Optimization (Vol. 2, pp.373-382). Hingham, MA: Kluwer Academic Publishers.
17. Resende, M. and Ribeiro, C. (2002) 'Greedy randomized adaptive search procedures', in F. Glover and G. Kochenberger (Eds), Handbook of Meta-Heuristics (pp.219-249). Hingham, MA: Kluwer Academic Publishers.
18. Santos, H.G., Ochi, L.S. and Souza, M.J.F. (2005) 'A tabu search heuristic with e client diverse cation strategies for the class/teacher timetabling problem', ACM Journal of Experimental Algorithms, Vol.10, pp.1-16.
19. Schaerf, A. (1999a) 'Local search techniques for large high-school timetabling problems', IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, Vol.29, pp.368-377.
20. Schaerf, A. (1999b) 'A survey of automated timetabling', Artificial Intelligence Review, Vol.13, pp.87-127.
21. Schaerf, A. and Di Gaspero, L. (2001) 'Local search techniques for educational timetabling problems', in L. Lenart, L.Z. Stirn and S. Drobne (Eds), Paper presented in the Proceedings of the 6th International Symposium on Operations Research in Slovenia (SOR-01) (pp.13-23). Preddvor, Slovenia. (Pubitemid 33314597)
22. Souza, M., Maculan, N. and Ochi, L. (2003) 'A GRASP-Tabu Search algorithm for school timetabling problems', in M. Resende and J. de Sousa (Eds), Metaheuristics: Computer Decision-making (pp.659-672). Hingham, MA: Kluwer Academic Publishers.