Simulated annealing with improved reheating and learning for the post enrolment course timetabling problem

References

• Abdullah, S., Burke, E. K., & McCollum, B. (2005). An investigation of variable neighbourhood search for university course timetabling. The 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA) (p. 413-427).
   Google Scholar
• Abdullah, S., Burke, E. K., & McCollum, B. (2007). A hybrid evolutionary approach to the university course timetabling problem. In Evolutionary Computation ( CEC 2007, pp. 1764-1768). IEEE.
   Google Scholar
• Abdullah, S., Shaker, K., McCollum, B., & McMullan, P. (2009). Construction of course timetables based on great deluge and tabu search. Metaheuristics Int. Conf., VIII Meteheuristic ( pp. 13-16).
   Google Scholar
• Arntzen, H., & Lokketangen, A. (2003). A local search heuristic for a university timetabling problem. nine, 1(T2), T45
   Google Scholar
• Burke, E., Bykov, Y., Newall, J., & Petrovic, S. (2003). A time-predefined approach to course timetabling. The Yugoslav Journal of Operations Research, 13(2), 139–151. ISSN: 0354–0243 EISSN: 2334–6043.
   Google Scholar
• Burke, E., Jackson, K., Kingston, J. H., & Weare, R. (1997). Automated university timetabling: The state of the art. The Computer Journal, 40(9), 565–571.
   Web of Science ®Google Scholar
• Burke, E. K., Kendall, G., & Soubeiga, E. (2003). A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics, 9(6), 451–470.
   Web of Science ®Google Scholar
• Cambazard, H., Hebrard, E., OSullivan, B., & Papadopoulos, A. (2012). Local search and constraint programming for the post enrolment-based course timetabling problem. Annals of Operations Research, 194(1), 111–135.
   Web of Science ®Google Scholar
• Ceschia, S., Di Gaspero, L., & Schaerf, A. (2012). Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem. Computers & Operations Research, 39(7), 1615–1624.
   Web of Science ®Google Scholar
• Chiarandini, M., Birattari, M., Socha, K., & Rossi-Doria, O. (2006). An effective hybrid algorithm for university course timetabling. Journal of Scheduling, 9(5), 403–432.
   Web of Science ®Google Scholar
• Chiarandini, M., Fawcett, C., & Hoos, H. H. (2008). A modular multiphase heuristic solver for post enrollment course timetabling. Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2008).
   Google Scholar
• Cooper, T. B., & Kingston, J. H. (1996). The complexity of timetable construction problems. Berlin: Springer.
   Google Scholar
• Cordeau, J. F., Jaumard, B., & Morales, R. (2003). Efficient timetabling solution with tabu search. In International Timetabling Competition.
   Google Scholar
• de Werra, D. (1985). An introduction to timetabling. European Journal of Operational Research, 19(2), 151–162.
   Web of Science ®Google Scholar
• Di Gaspero, L., & Schaerf, A. (2003). Timetabling competition ttcomp 2002: solver description. ( International Timetabling Competition).
   Google Scholar
• Ejaz, N., & Javed, M.Y. (2007). A hybrid approach for course scheduling inspired by die-hard co-operative ant behavior. Automation and Logistics, 2007 IEEE International Conference on (p. 3095–3100). IEEE.
   Google Scholar
• Goh, S. L., Kendall, G., & Sabar, N. R. (2017). Improved local search approaches to solve post enrolment course timetabling problem. European Journal of Operational Research, 261(1), 17–29.
   Web of Science ®Google Scholar
• Jaradat, G. M., & Ayob, M. (2010). An elitist-ant system for solving the post-enrolment course timetabling problem. Database Theory and Application, Bio-Science and Bio-Technology (pp. 167–176). Berlin: Springer.
   Google Scholar
• Kostuch, P. (2003). Timetabling competition-sa-based heuristic. International Timetabling Competition.
   Google Scholar
• Kostuch, P. (2005). The university course timetabling problem with a three-phase approach. Practice and Theory of Automated Timetabling (pp. 109–125). Berlin: Springer.
   Google Scholar
• Kuhn, H. W. (1955). The hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2(1), 83–97.
   Google Scholar
• Landa-Silva, D., & Obit, J.H. (2008). Great deluge with non-linear decay rate for solving course timetabling problems. Intelligent Systems, 2008. IS’08. 4th International IEEE Conference (Vol. 1, pp. 8-11). IEEE.
   Google Scholar
• Lewis, R. (2008). A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum, 30(1), 167–190.
   Web of Science ®Google Scholar
• Lewis, R. (2012). A time-dependent metaheuristic algorithm for post enrolment-based course timetabling. Annals of Operations Research, 194(1), 273–289.
   Web of Science ®Google Scholar
• Lewis, R., & Thompson, J. (2015). Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem. European Journal of Operational Research, 240(3), 637–648.
   Web of Science ®Google Scholar
• Lu, Z. & Hao, J.-K. (2010). Adaptive tabu search for course timetabling. European Journal of Operational Research, 200(1), 235–244.
   Web of Science ®Google Scholar
• McMullan, P. (2007). An extended implementation of the great deluge algorithm for course timetabling. Computational Science-ICCS 2007 (pp. 538–545). Berlin: Springer.
   Google Scholar
• Muller, T. (2009). Itc 2007 solver description: A hybrid approach. Annals of Operations Research, 172(1), 429–446.
   Web of Science ®Google Scholar
• Nothegger, C., Mayer, A., Chwatal, A., & Raidl, G. R. (2012). Solving the post enrolment course timetabling problem by ant colony optimization. Annals of Operations Research, 194(1), 325–339.
   Web of Science ®Google Scholar
• Obit, J., Landa-Silva, D., Ouelhadj, D., & Sevaux, M. (2009). Non-linear great deluge with learning mechanism for solving the course timetabling problem. 8th Metaheuristics International Conference (MIC 2009).
   Google Scholar
• Otten, R. H., & van Ginneken, L. P. (2003). Floorplan design using annealing. The Best of ICCAD (pp. 479–488). Berlin: Springer.
   Google Scholar
• Petrovic, S., & Burke, E. K. (2004). University timetabling. Handbook of scheduling: algorithms, models, and performance analysis, 45, 1–23.
   Google Scholar
• Romeo, F., Sangiovanni, V. A., & Huang, M. (1986). An efficient general cooling schedule for simulated annealing. Proceeding of IEEE International Conference on Computer Aided Design (pp. 396–404).
   Google Scholar
• Sabar, N. R., Ayob, M., Kendall, G., & Qu, R. (2012). A honey-bee mating optimization algorithm for educational timetabling problems. European Journal of Operational Research, 216(3), 533–543.
   Web of Science ®Google Scholar
• Schaerf, A. (1999). A survey of automated timetabling. Artificial Intelligence Review, 13(2), 87–127.
   Web of Science ®Google Scholar
• Shaker, K., & Abdullah, S. (2010). Controlling multi algorithms using round robin for university course timetabling problem. Database Theory and Application, Bio-Science and Bio-Technology (pp. 47–55). Berlin: Springer.
   Google Scholar
• Socha, K., Knowles, J., & Sampels, M. (2002). A max-min ant system for the university course timetabling problem. In Ant algorithms (pp. 1–13). Berlin: Springer.
   Google Scholar
• Thompson, J. M., & Dowsland, K. A. (1996). Variants of simulated annealing for the examination timetabling problem. Annals of Operations Research, 63(1), 105–128.
   Web of Science ®Google Scholar
• Triki, E., Collette, Y., & Siarry, P. (1998). A theoretical study on the behavior of simulated annealing leading to a new cooling schedule. European Journal of Operational Research, 166(1), 77–92.
   Web of Science ®Google Scholar
• Turabieh, H., Abdullah, S., McCollum, B., & McMullan, P. (2010). Fish swarm intelligent algorithm for the course timetabling problem. In Rough Set and Knowledge Technology (pp. 588–595). Berlin: Springer.
   Google Scholar
• Van Laarhoven, P. J., & Aarts, E. H. (1987). Simulated annealing: theory and applications (Vol. 37), Berlin: Springer Science & Business Media.
   Google Scholar