A co-evolutionary algorithm approach to a university timetable system

被引:0
作者
Chan, CK [1 ]
Gooi, HB [1 ]
Lim, MH [1 ]
机构
[1] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 2263, Singapore
来源
CEC'02: PROCEEDINGS OF THE 2002 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2 | 2002年
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper describes an automated curriculum timetabling system based on a stochastic search methodology, namely a co-evolutionary algorithm. The application timetable is taken from the undergraduate courses of the School of Electrical and Electronic Engineering (EEE), Nanyang Technological University (NTU). A co-evolutionary algorithm approach is found to be well suited. Practical courses have duration greater than one hour. A schedule can be generated separately and its population, which consists of a set of practical schedules, is termed as the practical population. Lecture and tutorial schedules can also be generated separately. These are of one-hour duration and they are termed collectively as lecture/tutorial schedule. A set of lecture/tutorial schedules could be generated to form the lecture/tutorial population. These two populations use the same set of resources and have constraining effects upon one another. Since the placement of practical courses have a more constraining effect, the schedules in the practical population are first generated and are then used to guide the generation of the set of lecture/tutorial schedules. For every lecture/tutorial schedule generated, it is combined with its corresponding practical schedule to form a combined schedule. The average fitness of all the combined schedules is then computed and used as a measure of the fitness of the practical schedule that drives them. The practical population is then evolved progressively to obtain the best practical schedule. It is then used as a base configuration for the rest of the courses to populate and evolve. The resultant system compares favorably to the current manual system.
引用
收藏
页码:1946 / 1951
页数:6
相关论文
共 12 条
[1]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[2]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[3]   A multistage evolutionary algorithm for the timetable problem [J].
Burke, EK ;
Newall, JP .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 1999, 3 (01) :63-74
[4]  
BURKE EK, 1997, P ICONIP 97 C DUN NZ, P469
[5]  
BURKE EK, 1995, P 6 INT C GEN ALG IC, P605
[6]  
BURKE EK, 1993, P IEEE C RES SCH LAR
[7]  
CATER MW, 1995, 1 INT C PRACT THEOR, P3
[8]  
CATER MW, 1997, 2 INT C PRACT THEOR, P3
[9]  
Dawkins R., 1976, SELFISH GENE
[10]  
Schaerf A., 1996, P 13 NAT C AM ASS AR