Advertisement

Annals of Operations Research

, Volume 239, Issue 1, pp 119–134 | Cite as

Repairing high school timetables with polymorphic ejection chains

  • Jeffrey H. Kingston
Article

Abstract

This paper introduces polymorphic ejection chains, and applies them to the problem of repairing time assignments in high school timetables while preserving regularity. An ejection chain is a sequence of repairs, each of which removes a defect introduced by the previous repair. Just as the elements of a polymorphic list may have different types, so in a polymorphic ejection chain the individual repairs may have different types. Methods for the efficient realization of these ideas, implemented in the author’s KHE framework, are given, and some initial experiments are presented.

Keywords

High school timetabling Ejection chains 

References

  1. Ahuja, R., Ergun, Ö., Orlin, J., & Punnen, A. (2002). A survey of very large-scale neighbourhood search techniques. Discrete Applied Mathematics, 123, 75–102. CrossRefGoogle Scholar
  2. Ásgeirsson, E. I. (2010). Bridging the gap between self schedules and feasible schedules in staff scheduling. In Eighth international conference on the Practice and Theory of Automated Timetabling, PATAT2010, Belfast. Google Scholar
  3. de Haan, P., Landman, R., Post, G., & Ruizenaar, H. (2007). A case study for timetabling in a Dutch secondary school. In Lecture notes in computer science: Vol. 3867. Practice and theory of automated timetabling VI (pp. 267–279). Berlin: Springer. CrossRefGoogle Scholar
  4. Dowsland, K. A. (1998). Nurse scheduling with tabu search and strategic oscillation. European Journal of Operational Research, 106, 393–407. CrossRefGoogle Scholar
  5. Glover, F. (1996). Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics, 65, 223–253. CrossRefGoogle Scholar
  6. Kempe, A. B. (1879). On the geographical problem of the four colours. American Journal of Mathematics, 2, 3. CrossRefGoogle Scholar
  7. Kim, M.-J., & Chung, T.-C. (1997). Development of automatic course timetabler for university. In Proceedings of the 2nd international conference on the practice and theory of automated timetabling (pp. 182–186). Google Scholar
  8. Kingston, J. H. (2005). A tiling algorithm for high school timetabling. In Springer lecture notes in computer science: Vol. 3616. Practice and theory of automated timetabling V (pp. 208–225). CrossRefGoogle Scholar
  9. Kingston, J. H. (2007). Hierarchical timetable construction. In Springer lecture notes in computer science: Vol. 3867. Practice and theory of automated timetabling VI (pp. 294–307). CrossRefGoogle Scholar
  10. Kingston, J. H. (2010a). The KHE High School timetabling engine. http://www.it.usyd.edu.au/~jeff/khe.
  11. Kingston, J. H. (2010b). The HSEval High School timetable evaluator. http://www.it.usyd.edu.au/~jeff/hseval.cgi.
  12. Kingston, J. H. (2012a). Resource assignment in high school timetabling. Annals of Operations Research, 194, 241–254. CrossRefGoogle Scholar
  13. Kingston, J. H. (2012b). Timetable construction: the algorithms and complexity perspective. Annals of Operations Research. doi: 10.1007/s10479-012-1160-z Google Scholar
  14. Meyers, C., & Orlin, J. B. (2007). Very large-scale neighbourhood search techniques in timetabling problems. In Springer lecture notes in computer science: Vol. 3867. Practice and theory of automated timetabling VI (pp. 24–39). CrossRefGoogle Scholar
  15. Morgernstern, C., & Shapiro, H. (1989). Chromatic number approximation using simulated annealing. Technical report CS86-1, Department of Computer Science, University of New Mexico. Google Scholar
  16. Papadimitriou, C. H., & Steiglitz, K. (1982). Combinatorial optimization: algorithms and complexity. New York: Prentice Hall. Google Scholar
  17. Parkes, A. J. (2010). Combined Blackbox and AlgebRaic Architecture (CBRA). In Eighth international conference on the Practice and Theory of Automated Timetabling, PATAT2010, Belfast. Google Scholar
  18. Post, G., Kingston, J. H., Ahmadi, S., Daskalaki, S., Gogos, C., Kyngäs, J., Nurmi, C., Musliu, N., Pillay, N., Santos, H., & Schaerf, A. (2011). XHSTT: an XML archive for high school timetabling problems in different countries. Annals of Operations Research. doi: 10.1007/s10479-011-1012-2. Google Scholar
  19. Post, G. (2011). High school timetabling web site. http://www.utwente.nl/ctit/hstt/.
  20. Post, G., Ahmadi, S., & Geertsema, F. (2012a). Cyclic transfers in school timetabling. OR Spektrum, 34, 133–154. CrossRefGoogle Scholar
  21. Post, G., Ahmadi, S., Daskalaki, S., Kingston, J. H., Kyngäs, J., Nurmi, C., & Ranson, D. (2012b). An XML format for benchmarks in high school timetabling. Annals of Operations Research, 194, 385–397. CrossRefGoogle Scholar
  22. Ryan, D. M., & Rezanova, N. J. (2010). The train driver recovery problem—solution method and decision support system framework. In Eighth international conference on the Practice and Theory of Automated Timetabling, PATAT2010, Belfast. Google Scholar
  23. Thompson, J., & Dowsland, K. A. (1995). General cooling schedules for a simulated annealing based timetabling system. In Springer lecture notes in computer science: Vol. 1153. First international conference on Practice and Theory of Automated Timetabling, PATAT1995, Edinburgh (pp. 262–345). Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.School of Information TechnologiesThe University of SydneySydneyAustralia

Personalised recommendations