Greedy Ants Colony Optimization Strategy for Solving the Curriculum Based University Course Timetabling Problem
Kenekayoro Patrick, Zipamone Godswill
Journal of Advances in Mathematics and Computer Science · pp. 1–10 · Published 3 Feb 2016
10.9734/BJMCS/2016/23143Abstract
Timetabling is a problem faced in all higher education institutions. The International Timetabling Competition (ITC) has published a dataset that can be used to test the quality of methods used to solve this problem. A number of meta-heuristic approaches have obtained good results when tested on the ITC dataset, however few have used the ant colony optimization technique, particularly on the ITC 2007 curriculum based university course timetabling problem. This study describes an ant system that solves the curriculum based university course timetabling problem and the quality of the algorithm is tested on the ITC 2007 dataset. The ant system was able to find feasible solutions in all instances of the dataset and close to optimal solutions in some instances. The ant system performs better than some published approaches, however results obtained are not as good as those obtained by the best published approaches. This study may be used as a benchmark for ant based algorithms that solve the curriculum based university course timetabling problem.
Cited by 16
V. Kralev, Radoslava Kraleva · International journal of advanced computing research · 2016
V. Kralev, Radoslava Kraleva, Borislav Yurukov · arXiv.org · 2016
Kaixiang Zhu, Lily D. Li, Michael Li · 2021
Son Tung Ngo · Journal of Southwest Jiaotong University · 2020
Kaixiang Zhu, Lily D. Li, Michael Li · Mathematics · 2021
Recep ÇOLAK, Tuncay YİĞİT · Düzce Üniversitesi Bilim ve Teknoloji Dergisi · 2021
Related research
- A Mathematical Programming Model and Enhanced Simulated Annealing Algorithm for the School Timetabling Problem — shares topic coverage
- Meta-Heuristic Solutions to a Student Grouping Optimization Problem faced in Higher Education Institutions — shares topic coverage
- Approximation Algorithms for \(\alpha\)-bisubmodular Function Maximization Subject to Matroid Constraint — shares topic coverage
Article metrics
Real usage data collected on this platform.
13
Page views
0
PDF downloads
1
Outbound clicks
16
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.