An evolutionary algorithm based subject allocation system

被引:1
作者
Chan, Chee Keong [1 ]
Gooi, Hoay Beng [1 ]
Lim, Meng Hiot [1 ]
机构
[1] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
关键词
evolutionary algorithms; subject allocation; directed window mutation;
D O I
10.1080/02533839.2006.9671137
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In the School of Electrical and Electronic Engineering (EEE), Nanyang Technological University (NTU), allocation of subjects according to preferences indicated by students during registration is a complex optimization problem. We propose an evolutionary algorithm based system that attempts to maximize satisfaction for the overall student group. The system is able to improve the satisfaction level from 61% to 74% even though some of the classes may be heavily oversubscribed. A novel mutation scheme, known as Directed Window Mutation is used and it is shown to be effective. Results of testing on a sample student group have been positive. The system will greatly reduce the level of frustration and unhappiness of students during the subject registration. In addition, it will result in significant cost and time saving for the School's Administrative body. The feedback on this proposed system has been positive from both the students and administrators.
引用
收藏
页码:415 / 422
页数:8
相关论文
共 13 条
  • [1] [Anonymous], 1989, GENETIC ALGORITHM SE
  • [2] [Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
  • [3] BACK T, 2000, EVOLUTIONARY COMPUTA, V2
  • [4] Back T., 2000, EVOLUTIONARY COMPUTA, V1
  • [5] A multistage evolutionary algorithm for the timetable problem[J]. Burke, EK;Newall, JP. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 1999(01)
  • [6] BURKE EK, 1997, P ICONIP 97 C DUN NZ, P469
  • [7] BURKE EK, 1995, P 6 INT C GEN ALG
  • [8] CATER MW, 1997, P 2 INT C PRACT THEO, V2, P3
  • [9] CATER MW, 1995, P 1 INT C PRACT THEO, P3
  • [10] Chan CK, 2002, IEEE C EVOL COMPUTAT, P1946