An ant colony algorithm for universiti sultan zainal abidin examination timetabling problem
The real-life construction of examination timetabling problem is considered as a common problem that always encountered and experienced in educational institution whether in school, college, and university. This problem is usually experienced by the academic management department where they have tro...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | EJournal Article |
| Published: |
Institute of Advanced Engineering and Science,
2019-01-01.
|
| Subjects: | |
| Online Access: | Get fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 02614 am a22003373u 4500 | ||
|---|---|---|---|
| 001 | ijeecs16569_10272 | ||
| 042 | |a dc | ||
| 100 | 1 | 0 | |a Khair, Ahmad Firdaus |e author |
| 100 | 1 | 0 | |e contributor |
| 700 | 1 | 0 | |a Makhtar, Mokhairi |e author |
| 700 | 1 | 0 | |a Mazlan, Munirah |e author |
| 700 | 1 | 0 | |a Mohamed, Mohamad Afendee |e author |
| 700 | 1 | 0 | |a Rahman, Mohd Nordin Abdul |e author |
| 245 | 0 | 0 | |a An ant colony algorithm for universiti sultan zainal abidin examination timetabling problem |
| 260 | |b Institute of Advanced Engineering and Science, |c 2019-01-01. | ||
| 500 | |a https://ijeecs.iaescore.com/index.php/IJEECS/article/view/16569 | ||
| 520 | |a The real-life construction of examination timetabling problem is considered as a common problem that always encountered and experienced in educational institution whether in school, college, and university. This problem is usually experienced by the academic management department where they have trouble to handle complexity for assign examination into a suitable timeslot manually. In this paper, an algorithm approach of ant colony optimisation (ACO) is presented to find an effective solution for dealing with Universiti Sultan Zainal Abidin (UniSZA) examination timetabling problems. A combination of heuristic with ACO algorithm contributes the development solution in order to simplify and optimize the pheromone occurrence of matrix updates which include the constraints problem. The implementation of real dataset instances from academic management is applied to the approach for generating the result of examination timetable. The result and performance that obtained will be used for further use to evaluate the quality and observe the solution whether our examination timetabling system is reliable and efficient than the manual management that can deal the constraints problem. | ||
| 540 | |a Copyright (c) 2018 Institute of Advanced Engineering and Science | ||
| 540 | |a http://creativecommons.org/licenses/by-nc/4.0 | ||
| 546 | |a eng | ||
| 690 | |||
| 690 | |a Examination Timetabling, Ant Colony Optimisation, Heuristic, Pheromone, Constraints | ||
| 655 | 7 | |a info:eu-repo/semantics/article |2 local | |
| 655 | 7 | |a info:eu-repo/semantics/publishedVersion |2 local | |
| 655 | 7 | |2 local | |
| 786 | 0 | |n Indonesian Journal of Electrical Engineering and Computer Science; Vol 13, No 1: January 2019; 191-198 | |
| 786 | 0 | |n 2502-4760 | |
| 786 | 0 | |n 2502-4752 | |
| 786 | 0 | |n 10.11591/ijeecs.v13.i1 | |
| 787 | 0 | |n https://ijeecs.iaescore.com/index.php/IJEECS/article/view/16569/10272 | |
| 856 | 4 | 1 | |u https://ijeecs.iaescore.com/index.php/IJEECS/article/view/16569/10272 |z Get fulltext |