.png){kind=icon}
返回
Memetic techniques for examination timetabling
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-013-1500-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we investigate the effectiveness of combining the main components of the memetic algorithms (MAs) on the quality of solutions produced for Uncapacitated Examination Timetabling Problem (UETP). These components are recombination, randomness, and neighbourhood structures. The Harmony Search Algorithm (HSA), which is a variation of MA, is used to perform different combinations of these components. It has three main components: Memory Consideration using the recombination, Random Consideration using the randomness and Pitch Adjustment using the neighbourhood structures (or local search). The combinations among MA components are evaluated using 17 different scenarios each of which reflects a combination of one, two or three components. The results show that the system that combines the three components (recombination, randomness, and neighbourhood structures) provides the best results. Furthermore, the best results obtained from the convergence scenarios were compared with 22 other methods that used a de facto dataset defined by Carter et al. (in Journal of the Operational Research Society 74:373-383, 1996) for UETP. The results exceed those produced by the previous methods in 2 out of 12 datasets.
Keyword:
Timetabling
Memetic algorithm
Harmony Search
Optimization
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
引用论文
Kinematic and kinetic differences in the execution of vertical jumps between people with good and poor ankle joint dorsiflexion踝关节背屈良好和不良的人在执行垂直跳跃时的运动学和动力学差异
.png){kind=icon}
PREAI
分享收藏An improved multi-staged algorithmic process for the solution of the examination timetabling problem
PREAI
分享收藏分享收藏
Metaheuristics in combinatorial optimization: Overview and conceptual comparison组合优化中的元启发式: 概述和概念比较
PREAI
分享收藏
查看更多内容