我要吃瓜

Citation

Beyrouthy C, Burke E, Landa Silva JD, McCollum B, McMullan P & Parkes AJ (2006) The teaching space allocation problem with splitting. In: Burke E & Rudova H (eds.) Practice and Theory of Automated Timetabling VI: 6th International Conference, PATAT 2006 Brno, Czech Republic, August 30–September 1, 2006 Revised Selected Papers. Lecture Notes in Computer Science, 3867. 6th International Conference, PATAT 2006, Practice and Theory of Automated Timetabling VI, Brno, Czech Republic, 30.08.2006-01.09.2006. Berlin Heidelberg: Springer, pp. 228-247. http://link.springer.com/chapter/10.1007/978-3-540-77345-0_15#; https://doi.org/10.1007/978-3-540-77345-0_15

Abstract
A standard problem within universities is that of teaching space allocation which can be thought of as the assignment of rooms and times to various teaching activities. The focus is usually on courses that are expected to fit into one room. However, it can also happen that the course will need to be broken up, or ‘split', into multiple sections. A lecture might be too large to fit into any one room. Another common example is that of seminars or tutorials. Although hundreds of students may be enrolled on a course, it is often subdivided into particular types and sizes of events dependent on the pedagogic requirements of that particular course. Typically, decisions as to how to split courses need to be made within the context of limited space requirements. Institutions do not have an unlimited number of teaching rooms, and need to effectively use those that they do have. The efficiency of space usage is usually measured by the overall ‘utilisation' which is basically the fraction of the available seat-hours that are actually used. A multi-objective optimisation problem naturally arises; with a trade-off between satisfying preferences on splitting, a desire to increase utilisation, and also to satisfy other constraints such as those based on event location and timetabling conflicts. In this paper, we explore such trade-offs. The explorations themselves are based on a local search method that attempts to optimise the space utilisation by means of a ‘dynamic splitting' strategy. The local moves are designed to improve utilisation and satisfy the other constraints, but are also allowed to split, and un-split, courses so as to simultaneously meet the splitting objectives.