Joe Henry Obit and Kuan Yik Junn and Rayner Alfred (2017) A performance comparison of metaheuristics search for university course timetabling problems. Journal of Computational and Theoretical Nanoscience, 23. pp. 11012-11015. ISSN 1936-6612 (P-ISSN) , 1936-7317 (E-ISSN)
![[img]](https://eprints.ums.edu.my/style/images/fileicons/text.png) |
Text
A performance comparison of metaheuristics search for university course timetabling problems_ABSTRACT.pdf Download (57kB) |
|
Text
A performance comparison of metaheuristics search for university course timetabling problems.pdf Restricted to Registered users only Download (636kB) |
Abstract
This research presents the metaheuristics approach in solving a real world problem of University Course Timetabling in Universiti Malaysia Sabah Labuan International Campus (UMSLIC), Malaysia. The problem domain in UMSLIC has several constraints which need to be satisfied. Solutions are considered as feasible if the hard constraints are satisfied, while minimizing the cost of soft constraints as much as possible. In this research, a Constraint Programming (CP) algorithm is proposed and implemented in order to solve the hard constraint while satisfying the soft constraints is handled by using the Great Deluge (GD) algorithm. A comparison performance of the linear and non-linear Great Deluge algorithm is also investigated based on the results obtained, the combination of CP and GD algorithms is effective to produce better solutions.
| Item Type: | Article |
|---|---|
| Keyword: | Constraint Programming , Great Deluge , University Course Timetabling |
| Subjects: | Q Science > QA Mathematics > QA1-939 Mathematics |
| Department: | FACULTY > Faculty of Computing and Informatics |
| Depositing User: | SAFRUDIN BIN DARUN - |
| Date Deposited: | 22 Dec 2021 16:53 |
| Last Modified: | 22 Dec 2021 16:53 |
| URI: | https://eprints.ums.edu.my/id/eprint/29044 |
Actions (login required)
 |
View Item |