Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Lewis, Rhyd (2012)
Publisher: Springer
Languages: English
Types: Article
Subjects: QA
A metaheuristic-based algorithm is presented for the post enrolment-based course timetabling problem used in track-2 of the Second International Timetabling Competition (ITC2007). The featured algorithm operates in three distinct stages—a constructive phase followed by two separate phases of simulated annealing—and is time dependent, due to the fact that various run-time parameters are calculated automatically according to the amount of computation time available. Overall, the method produces results in line with the official finalists to the timetabling competition, though experiments show that this algorithm also seems to find certain instances more difficult to solve than others. A number of reasons for this latter feature are discussed.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • Abramson, D., Krishnamoorthy, H., Dang, H., 1996. Simulated annealing cooling schedules for the school timetabling problem. Asia-Paci c Journal of Operational Research 16, 1{22.
    • Atsuta, M., Nonobe, K., Ibaraki, T., 2008. Itc-2007 track 2: An approach using general csp solver. URL www.cs.qub.ac.uk/itc2007/winner/bestcoursesolutions/Atsuta et al.pdf
    • Brelaz, D., 1979. New methods to color the vertices of a graph. Commun. ACM 22 (4), 251{256.
    • Burke, E., Gendreau, M. (Eds.), 2008. Proceedings of the Seventh International Conference for the Practice and Theory of Automated Timetabling. Universite de Montreal, Canada. URL http://www.asap.cs.nott.ac.uk/patat/patat08
    • Cambazard, H., Hebrard, E., Osullivan, B., A., P., 2008. Local search and constraint programming for the post-enrolment-based course timetabling problem. In: Burke and Gendreau (2008). URL http://www.asap.cs.nott.ac.uk/patat/patat08
    • Chiarandini, M., Fawcett, C., Hoos, H., 2008. A modular multiphase heuristic solver for post enrolment course timetabling. In: Burke and Gendreau (2008). URL http://www.asap.cs.nott.ac.uk/patat/patat08
    • Chiarandini, M., Stutzle, T., 2002. An application of iterated local search to graph coloring. In: Johnson, I. D., Mehrotra, A., Trick, M. (Eds.), Proceedings of the Computational Symposium on Graph Coloring and its Generalizations. New York, USA, pp. 112{125.
    • Di Gaspero, L., McCollum, B., Schaerf, A., August 2007. The second international timetabling competition (itc-2007): Curriculum-based course timetabling (track 3). Tech. Rep. QUB/IEEE/Tech/ITC2007/CurriculumCTT/v1.0/1, School of Computing, Queens University, Belfast.
    • Kirkpatrick, S., Gelatt, C., Vecchi, M., 1983. Optimization by simulated annealing. Science 4598, 671{680.
    • Kostuch, P., 2005. The university course timetabling problem with a 3-phase approach. In: Burke, E., Trick, M. (Eds.), Practice and Theory of Automated Timetabling (PATAT) V. Vol. 3616. Springer-Verlag, Berlin, pp. 109{125.
    • Lewis, R., 2006. Metaheuristics for university course timetabling. Ph.D. thesis, School of Computing, Napier University, Edinburgh.
    • Lewis, R., 2008. A time-dependent metaheuristic algorithm for post enrolment-based course timetabling. In: Burke and Gendreau (2008). URL http://www.asap.cs.nott.ac.uk/patat/patat08
    • Lewis, R., Paechter, B., McCollum, B., August 2007. Post enrolment based course timetabling: A description of the problem model used for track two of the second international timetabling competition. Cardi Working Papers in Accounting and Finance A2007-3, Cardi Business School, Cardi University, ISSN: 1750-6658.
    • Mayer, A., Nothegger, C., Chwatal, A., Raidl, G., 2008. Solving the post enrolment course timetabling problem by ant colony optimization. In: Burke and Gendreau (2008). URL http://www.asap.cs.nott.ac.uk/patat/patat08
    • McCollum, B., McMullan, P., Burke, E., Parkes, A., Qu, R., September 2007. The second international timetabling competition: Examination track. Tech. Rep. QUB/IEEE/Tech/ITC2007/Exam/v4.0/17, School of Computing, Queens University, Belfast.
    • McCollum, B., Schaerf, A., Paechter, B., McMullan, P., Lewis, R., Parkes, A., de Gaspero, L., Qu, R., Burke, E., 2009. Setting the research agenda in automated timetabling: The second international timetabling competition. INFORMS Journal on Computing 10.1287/ijoc.1090.0320.
    • Muller, T., 2008. ITC2007: Solver description. In: Burke and Gendreau (2008). URL http://www.asap.cs.nott.ac.uk/patat/patat08
    • (EvoCOP 2003). Vol. 2611. Springer-Verlag, Berlin, pp. 334{345.
    • Thompson, J., Dowsland, K., 1998. A robust simulated annealing based examination timetabling
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article