Title
A hybrid grouping genetic algorithm for assigning students to preferred laboratory groups
Abstract
This paper presents a novel application of the hybrid grouping genetic algorithm in a problem related to university timetabling. Specifically, the assignment of students to laboratory groups is tackled. This problem includes an important constraint of capacity, due to laboratories usually have a maximum number of equips or computers available, so the number of total students in a group is constrained to be equal or less than the capacity of the laboratory. In addition, our approach considers the case in which the students provide a sorted list of preferred laboratory groups, so the objective of the assignment must take this point into account. A variation of the problem in which a balanced number of students per group is required (lecturer preferences) is also studied in this paper. The performance of the approach is shown in different test problems and in a real application in a Spanish University.
Year
DOI
Venue
2009
10.1016/j.eswa.2008.09.020
Expert Syst. Appl.
Keywords
Field
DocType
real application,different test problem,timetabling,hybrid grouping genetic algorithm,laboratory group,balanced number,grouping genetic algorithms,combinatorial optimization,assignment problems,novel application,important constraint,maximum number,assigning student,preferred laboratory group,spanish university,assignment problem
Weapon target assignment problem,Mathematical optimization,Computer science,Generalized assignment problem,Combinatorial optimization,Artificial intelligence,Machine learning,Genetic algorithm
Journal
Volume
Issue
ISSN
36
3
Expert Systems With Applications
Citations 
PageRank 
References 
17
0.75
16
Authors
5