Novel local-search-based approaches to university examination timetabling

INFORMS Journal on Computing

Volumn 20, Issue 1, 2008, Pages 86-99

  Caramia, Massimiliano ^a   Dell'Olmo, Paolo ^b   Italiano, Giuseppe F ^a  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Algorithm; Examination timetabling; Local search

Indexed keywords

EID: 56449131091     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1070.0220     Document Type: Article

References (23)

1. Asmuni, H., E. K. Burke, J. M. Garibaldi. 2005. Fuzzy multiple ordering criteria for examination timetabling. E. K. Burke, M. Trick, eds. Practice and Theory of Automated Timetabling V. Lecture Notes in Computer Science, Vol. 3616. Springer, Berlin, 334-353.
2. Burke, E. K., J. P. Newall. 1999. A multi-stage evolutionary algorithm for the timetabling problem. IEEE Trans. Evolutionary Comput. 3 63-74.
3. Burke, E. K., J. P. Newall. 2003. Enhancing timetable solutions with local search methods. E. K. Burke, P. De Causmaecker, eds. Practice and Theory of Automated Timetabling TV. Lecture Notes in Computer Science, Vol. 2740. Springer, Berlin, 195-206.
4. Burke, E. K., J. P. Newall. 2004. Solving examination timetabling problems through adaptation of heuristic orderings. Ann. Oper. Res. 129 107-134.
5. Burke, E. K., J. H. Kingston, D. Dc Werra. 2004a. Applications to timetabling. J. Gross, J. Yellen, eds. Handbook of Graph Theory. Chapman Hall/CRC Press, Boca Raton, FL, 445-474.
6. Burke, E. K., Y. Bykov, J. P. Newall, S. Petrovic. 2004b. A time- predefined local search approach to exam timetabling problems. IIE Trans. 36 509-528.
7. Burke E. K., J. P. Newall, R. F. Weare. 1996a. A memetic algorithm for university exam timetabling. E. K. Burke, P. Ross, eds. Practice and Theory of Automated Timetabling I. Lecture Notes in Computer Science, Vol. 1153. Springer, Berlin, 241-250.
8. Burke, E. K., D. G. Elliman, P. H. Ford, R. F. Weare. 1996b. Examination timetabling in British universities-A survey. E. K. Burke, P. Ross, eds. Practice and Theory of Automated Timetabling I. Lecture Notes in Computer Science, Vol. 1153. Springer, Berlin, 76-92.
9. Caramia, M., P. Dell'Olmo, G. F. Italiano. 2001. New algorithms for examination timetabling. S. Naher, D. Wagner, eds. Algorithm Engrg. 4th Internal. Workshop. Lecture Notes in Computer Science, Vol. 1982. Springer, Berlin, 230-241.
10. Carter, M. W, G. Laporte. 1996. Recent developments in practical examination timetabling. E. K. Burke, P. Ross, eds. Practice and Theory of Automated Timetabling I. Lecture Notes in Computer Science, Vol. 1153. Springer, Berlin, 3-21.
11. Casey, S., J. Thompson. 2003. GRASPing the examination scheduling problem. E. K. Burke, P. De Causmaecker, eds. Practice and Theory of Automated Timetabling TV. Lecture Notes in Computer Science, Vol. 2740. Springer, Berlin, 232-244.
12. Cote, P., T, Wang, R, Sabourin. 2005, Application of a hybrid multi- objective evolutionary algorithm to the uncapacitated exam proximity problem. E. K. Burke, M. Trick, eds. Practice and theory of Automated Timetabling V. Lecture Notes in Computer Science, Vol. 3616. Springer, Berlin, 294-312.
13. Gaspero, L., A. Schaerf. 2001. Tabu search techniques for examination timetabling problems. E. K. Burke, W. Erben, eds. Practice and Theory of Automated Timetabling III. Lecture Notes in Computer Science, Vol. 2079. Springer, Berlin, 104-117.
14. Glover, F. 2000. Multi-start and strategic oscillation methods principles to exploit adaptive memory. M. Laguna, J. L. Gonzales-Valarde, eds. Computing Tools for Modelling Optimization and Simulation: Interfaces in Computer Science and Operations Research. Kluwer Academic Publishers, Amsterdam, 1-24.
15. Hart, J. P., A. W. Shogan. 1987. Semi-greedy heuristics: An empirical study. Oper. Res. Lett. 6 107-114.
16. Kendall, G., N. Mohd Hussin. 2005. An investigation of a tabu search based hyper-heuristic for examination timetabling. G. Kendall, E. K. Burke, S. Petrovic, M. Gendreau, eds. Multi-Disciplinary Scheduling: Theory and Applications. Springer, Berlin, 309-328.
17. Merlot, L. T. G., N. Boland, B. D. Hughes, P. J. Stuckey. 2003. A hybrid algorithm for the examination timetabling problem. E. K. Burke, P. De Causmaecker, eds. Practice and Theory of Automated Timetabling TV. Lecture Notes in Computer Science, Vol. 2740. Springer, Berlin, 207-231.
18. Petrovic, S., E. K. Burke. 2004. University timetabling. J. Leung, ed. Handbook of Scheduling, Chap. 45. Chapman Hall/CRC Press, Boca Raton, FL.
19. Petrovic, S., Y. Yang, M. Dror. 2003. Case-based initialisation of metaheuristics for examination timetabling. G. Kendall, E. K. Burke, S. Petrovic, M. Gendreau, eds. Multi-disciplinary Scheduling: Theory and Applications. Springer, Berlin, 289-308.
20. Resende, M. G. C, C. C. Ribeiro. 2002. Greedy randomized adaptive search procedures. F. Glover, G. Kochenberger, eds. Handbook in Metaheuristics. Kluwer Academic Publishers, Amsterdam, 219-249.
21. Thompson, J. M., K. A. Dowsland. 1998. A robust simulated annealing based examination timetabling system. Comput. Oper. Res. 25 637-648.
22. White, G. M., B. S. Xie. 2001. Examination timetables and tabu search with longer-term memory. E. K. Burke, W. Erben, eds. Practice and Theory of Automated Timetabling III. Lecture Notes in Computer Science, Vol. 2079. Springer, Berlin, 85-103.
23. Yang, Y, S. Petrovic. 2005. A novel similarity measure for heuristic selection in examination timetabling. E. K. Burke, M. Trick, eds. Practice and Theory of Automated Timetabling V. Lecture Notes in Computer Science, Vol. 3616. Springer, Berlin, 247-269.