.png){kind=icon}
返回
An ant colony based timetabling tool
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijpe.2013.04.026.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The timetabling of lecturers, seminars, practical sessions and examinations is a core business process for academic institutions. A feasible timetable must satisfy hard constraints. An optimum timetable will additionally satisfy soft constraints, which are not absolutely essential. An Ant Colony based Timetabling (ANCOT) tool has been developed for solving timetabling problems. New variants of Ant Colony Optimisation (ACO) called the Best-Worst Ant System (BWAS) and the Best-Worst Ant Colony System (BWACS) were embedded in the ANCOT program. Local Search.(LS) strategies were developed and embedded into BWAS and BWACS to enhance their efficiency and to help find the best timetable with the lowest number of soft constraint violations. Statistical tools for experimental design and analysis were adopted to investigate the factors affecting the BWAS performance. Eight benchmark problems were used for evaluating the performance. For large problems, the BWACS produced the best timetable and was better than the other ACO variants. The best proposed local search strategy enhanced the performance of both the BWAS and the BWACS by up to 74.5%, but this was at the expense of longer execution time. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Best-Worst ant
Ant system
Ant colony
Local search
Course timetabling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10
论文数:
8.0K
被引数:
3.6W
机构
引用论文
.png){kind=icon}
分享收藏Development of a stochastic optimisation tool for solving the multiple container packing problems
PREAI
分享收藏Metaheuristics in combinatorial optimization: Overview and conceptual comparison组合优化中的元启发式: 概述和概念比较
PREAI
分享收藏分享收藏
查看更多内容