Programmierpraktikum Optimierung SS 17

• Surveys:
  • Carter, M.W. [1986]: A survey of practical applications of examination timetabling algorithms, Operations Research 34, 193-202.
  • Carter, M.W., Laporte, G. [1996]: Recent developments in practical examination timetabling, Lecture Notes in Computer Science 1153, 3-21.
  • Qu, R., Burke, E.K., McCollum, B., Merlot, L.T.G., Lee, S.Y. [2009]: A survey of search methodologies and automated system development for examination timetabling, Journal of Scheduling 12, 55-89.
• Heuristiken:
  • Abdullah, S., Ahmadi, S., Burke, E.K., Dror, M., McCollum, B. [2007]: A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem, Journal of the Operational Research Society 58, 1494-1502.
  • Abdullah, S., Ahmadi, S., Burke, E.K., Dror, M. [2007]: Investigating Ahuja-Orlin’s large neighbourhood search approach for examination timetabling, OR Spectrum 29, 351-372.
  • Asmunia, H., Burke, E.K., Garibald, J.M., McCollum, B., Parkes, A.J. [2009]: An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables, Computers and Operations Research 36, 981-1001.
  • Burke, E.K., Bykov, Y. [2016]: An adaptive flex-deluge approach to university exam timetabling, INFORMS Journal on Computing 28, 781-794.
  • Burke, E.K., Elliman, D., Weare, R. [1995]: Specialised recombinative operators for timetabling problems, AISB Workshop on Evolutionary Computing, Springer, 75-85.
  • Burke, E.K., Newall, J.P., Weare, R.F. [1996]: A memetic algorithm for university exam timetabling, Practice and Theory of Automated Timetabling, 241-250.
  • Burke, E.K., Newall, J.P. [2004]: Solving examination timetabling problems through adaption of heuristic orderings, Annals of Operations Research 129, 107-134.
  • Carter, M.W., Laporte, G., Lee, S.Y. [1996]: Examination timetabling: algorithmic strategies and applications, Journal of the Operational Research Society, 47, 373-383.
  • Dowsland, K. A., Thompson, J. [2005]: Ant colony optimisation for the examination scheduling problem, Journal of the Operational Research Society, 56, 426-438.
  • Eley, M. [2007]: Ant algorithms for the exam timetabling problem, Lecure Notes in Computer Science 3867, 364-382.
  • Thompson, J., Dowsland, K. [1996]: Variants of simulated annealing for the examination timetabling problem, Annals of Operations Research, 63, 105-128.
  • White, G. M., Xie, B. S., Zonjic, S. [2004]: Using tabu search with longer-term memory and relaxation to create examination timetables, European Journal of Operational Research, 153, 80-91.

Teilnahme

Teilnehmen können alle interessierten Bachelor-Studierenden der Informatik, die die Veranstaltung Einführung in die Kombinatorische Optimierung besucht haben.

Vorkenntnisse

Von den Teilnehmern werden erwartet:

• Kenntnisse aus der Veranstaltung Einführung in die Kombinatorische Optimierung
• Programmierkenntnisse in Java (wie sie z.B. durch Informatik A und B vermittelt werden)
• Grundlagen von Algorithmen und Datenstrukturen

Schein