Effective learning hyper-heuristics for the course timetabling problem.

European Journal of Operational Research(2014)

引用 70|浏览27
暂无评分
摘要
•Course timetabling constraints are converted into generic structures.•Two types of learning for operator selection are contrasted: online and offline.•An empirical approach for selecting the best operators from a pool is proposed.•Online learning shows competitive results, even producing new best-known solutions.•The proposed method achieves a balance between generality and effectiveness.
更多
查看译文
关键词
Timetabling,Hyper-heuristics,Heuristics,Metaheuristics,Combinatorial optimization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要