Optimizing satisfaction in a multi-courses allocation problem combined with a timetabling problem
- 141 Downloads
The resource allocation problem and the timetabling problem are traditional kinds of NP-hard problems. Both problems can be found in universities where students can select courses they would like to attend before or after the timetabling is done. When demand exceeds capacity, the universities may allocate the available seats independently from the timetabling, but students may have then to decide which courses they are going to attend because of clashes in their timetable. To avoid this situation, some universities prepare their timetable considering students selection. In addition to that, students may submit preferences over courses, and the school administration has to assign seats and do the timetable considering both preferences and clashes. In this paper, both problems, seats allocation and timetabling, have been modeled separately and combined as constraint satisfaction optimization problems (CSOP). Two algorithms have been designed and implemented to find a solution to both problems simultaneously maximizing the satisfaction of students using a CSOP solver and an Ant colony optimization algorithm for the timetabling problem. The results of both algorithms are then compared. The allocation and timetabling procedures are based on preferences for courses defined by students, and on the administration’s constraints at Ecole Hôtelière de Lausanne. Three real data sets have been used to carry out a complete experimental analysis. High-quality solutions are obtained in a few minutes with both approaches; those solutions are currently used at Ecole Hôtelière de Lausanne.
KeywordsAnt colony optimization Constraint satisfaction optimization problem Resource allocation Timetabling
This work has been supported by following research grants: Comunidad Autonoma de Madrid, under CIBERDINE S2013/ICE-3095 project, and EphemeCH (TIN2014-56494-C4-4-P) project, under Spanish Ministry of Economy and Competitivity, both supported by the European Regional Development Fund FEDER.
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
This article does not contain any studies with human participants performed by any of the authors.
- Budish E, Cantillon E (2012) The multi-unit assignment problem: theory and evidence from course allocation at harvard. Am Econ Rev 102(5):2237–2271Google Scholar
- Cano JI, Sánchez L, Camacho D, Pulido E, Anguiano E (2009) Allocation of educational resources through happiness maximization. In: Proceedings of the 4th international conference on software and data technologiesGoogle Scholar
- Cano JI, Sánchez L, Camacho D, Pulido E, Anguiano E (2009) Using preferences to solve student–class allocation problem. In: Intelligent data engineering and automated learning-IDEAL 2009. Springer, Berlin, pp 626–632Google Scholar
- de Werra D (1985) An introduction to timetabling. Eur J Oper Res 19(2):151–162Google Scholar
- Di Gaspero L (2015) Integration of metaheuristics and constraint programming. In: Springer handbook of computational intelligence. Springer, Berlin, pp 1225–1237Google Scholar
- Di Gaspero L, McCollum B, Schaerf A (2007) The second international timetabling competition (itc-2007): curriculum-based course timetabling (track 3). Tech. rep., Technical Report QUB/IEEE/Tech/ITC2007/CurriculumCTT/v1. 0, Queens University, Belfast, UKGoogle Scholar
- Dorigo M, Birattari M (2010) Ant colony optimization. In: Encyclopedia of machine learning. Springer, Berlin, pp 36–39Google Scholar
- Lewis R, Paechter B, McCollum B et al (2007) Post enrolment based course timetabling: a description of the problem model used for track two of the second international timetabling competition. Cardiff Business SchoolGoogle Scholar
- McCollum B, Ireland N (2006) University timetabling: bridging the gap between research and practice. E Burke HR ed: PATAT pp 15–35Google Scholar
- Nogareda AM, Camacho D (2014) Integration of ant colony optimization algorithms with gecode. In: Doctoral program proceedings of the 20th international conference on principles and practice of constraint programmingGoogle Scholar
- Nogareda AM, Camacho D (2016) Optimizing satisfaction in a multi-courses allocation problem. In: Intelligent distributed computing IX. Springer, Berlin, pp 247–256Google Scholar
- Schulte C, Tack G, Lagerkvist MZ (2010) Modeling and programming with gecode. http://www.gecode.org/doc/4.4.0/MPG.pdf. Accessed 3 Oct 2016
- Socha K, Sampels M, Manfrin M (2003) Ant algorithms for the university course timetabling problem with regard to the state-of-the-art. In: Applications of evolutionary computing. Springer, Berlin, pp 334–345Google Scholar
- Solnon C (2010) Ant colony optimization and constraint programming. Wiley Online LibraryGoogle Scholar
- Tsang E (2014) Foundations of constraint satisfaction: the classic text. BoD–Books on DemandGoogle Scholar