An ant colony based timetabling tool

被引:25
作者
Thepphakorn, Thatchai [1 ]
Pongcharoen, Pupong [1 ]
Hicks, Chris [2 ]
机构
[1] Naresuan Univ, Fac Engn, Dept Ind Engn, Ctr Operat Res & Ind Applicat CORIA, Phitsanulok 65000, Thailand
[2] Newcastle Univ, Sch Business, Newcastle Upon Tyne NE1 7RU, Tyne & Wear, England
关键词
Best-Worst ant; Ant system; Ant colony; Local search; Course timetabling; OPTIMIZATION; ALGORITHMS; SYSTEM; DESIGN;
D O I
10.1016/j.ijpe.2013.04.026
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
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.
引用
收藏
页码:131 / 144
页数:14
相关论文
共 56 条
[1]  
[Anonymous], 2002, Mathware and Soft Computing
[2]  
Ayob M, 2009, 2009 2ND CONFERENCE ON DATA MINING AND OPTIMIZATION, P127
[3]   Use of genetic algorithms to solve production and operations management problems: a review [J].
Aytug, H ;
Khouja, M ;
Vergara, FE .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2003, 41 (17) :3955-4009
[4]   Hybrid heuristics for examination timetabling problem [J].
Azimi, ZN .
APPLIED MATHEMATICS AND COMPUTATION, 2005, 163 (02) :705-733
[5]   Metaheuristics in combinatorial optimization: Overview and conceptual comparison [J].
Blum, C ;
Roli, A .
ACM COMPUTING SURVEYS, 2003, 35 (03) :268-308
[6]   Ant colony optimization: Introduction and recent trends [J].
Blum, Christian .
PHYSICS OF LIFE REVIEWS, 2005, 2 (04) :353-373
[7]   A graph-based hyper-heuristic for educational timetabling problems [J].
Burke, Edmund K. ;
McCollum, Barry ;
Meisels, Amnon ;
Petrovic, Sanja ;
Qu, Rong .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (01) :177-192
[8]   A branch-and-cut procedure for the Udine Course Timetabling problem [J].
Burke, Edmund K. ;
Marecek, Jakub ;
Parkes, Andrew J. ;
Rudova, Hana .
ANNALS OF OPERATIONS RESEARCH, 2012, 194 (01) :71-87
[9]   Solving examination timetabling problems through adaption of heuristic orderings [J].
Burke, EK ;
Newall, JP .
ANNALS OF OPERATIONS RESEARCH, 2004, 129 (1-4) :107-134
[10]   Recent research directions in automated timetabling [J].
Burke, EK ;
Petrovic, S .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 140 (02) :266-280