A late acceptance strategy in hill-climbing for exam timetabling problems

7th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2008

Volumn , Issue , 2008, Pages

  Burke, Edmund K ^a   Bykov, Yuri ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84983114575     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Burke, E. K., Bykov, Y., Newall, J., & Petrovic, S. (2004). A time-predefined local search approach to exam timetabling problems. IIE Transactions, 36(6), 509-528.
2. Burke, E. K., & Kendall, G. e. (2005). Search methodologies: introductory tutorials in optimization and decision support techniques, Springer: New York.
3. Burke, E. K., & Bykov, Y. (2008). An adaptive flex-deluge approach to university exam timetabling. Submitted to INFORMS Journal of Computing.
4. Burke, E. K., Eckersley, A. J., McCollumn, B., Petrovic, S., & Qu, R. (2009, to appear). Hybrid variable neighborhood approaches to university exam timetabling. European Journal of Operational Research.
5. Caramia, M., Dell’Olmo, P., & Italiano, G. (2008). Novel local search based approaches to university examination timetabling. INFORMS Journal of Computing, 20, 86-99.
6. Carter, M. W., Laporte, G., & Lee, S. (1996). Examination timetabling: algorithmic strategies and applications. Journal of Operational Research Society, 47, 373-383.
7. Casey, S., & Thompson, J. (2003). GRASPing the examination scheduling problem. PATAT IV, Selected Revised Papers, Springer LNCS 2740, 232-246.
8. Dueck G. (1993). New optimization heuristics. The great deluge algorithm and the record-to-record travel. Journal of Computational Physics, 104, 86-92.
9. Glover, F., & Kochenberger, G.A. (2003). Handbook of metaheuristics. Kluwer Academic Publishers: Dordrecht.
10. Hu, T. C., Kahng, A. B, & Tsao, C.-W. A. (1995). Old bachelor acceptance: a new class of nonmonotone threshold accepting methods. ORSA Journal on Computing, 7, 417-425.
11. Laguna, M., & Glover, F. (1996). What is tabu search? Colorado Business Review, 61, 5-12.
12. Qu, R., Burke, E. K., McCollumn, B., Merlot, L. T. G., & Lee, S. Y. (2009 to appear). A survey of search methodologies and automated system development for examination timetabling. Journal of Scheduling.
13. Taillard, E. D., Gambardella, L. M., Gendreau, M., & Potvin J.-Y. (2001). Adaptive memory programming: a unified view of metaheuristics. European Journal of Operational Research, 135, 1-16.
14. Yang, Y., & Petrovic, S. (2005). A novel similarity measure for heuristic selection in examination timetabling. PATAT V. Revised Selected Papers. Springer LNCS 3616, 377-396.