.png){kind=icon}
返回
Finding feasible timetables using group-based operators
.png){kind=icon}
OA
AI
DOI：10.1109/TEVC.2006.885162.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper describes the applicability of the so-called grouping genetic algorithm to a well-known version of the university course timetabling problem. We note that there are, in fact, various scaling up issues surrounding this sort of algorithm and, in particular, see that it behaves in quite different ways with different sized problem instances. As a by-product of these investigations, we introduce a method for measuring population diversities and distances between individuals with the grouping representation. We also look at how such an algorithm might be improved: first, through the introduction of a number of different fitness functions and, second, through the use of an additional stochastic local-search operator (making in effect a grouping memetic algorithm). In many cases, we notice that the best results are actually returned when the grouping genetic operators are removed altogether, thus highlighting many of the issues that are raised in the study.
Keyword:
diversity
fitness-functions
grouping-problems
timetabling
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏ATMOSPHERIC OCCURRENCE OF 2-NITROBENZANTHRONE ASSOCIATED WITH AIRBORNE PARTICLES IN CENTRAL TOKYO
PREAI
分享收藏
查看更多内容