A performance comparison of metaheuristics search for university course timetabling problems
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 a...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
American Scientific Publishers
2017
|
| Subjects: | |
| Online Access: | https://eprints.ums.edu.my/id/eprint/29044/1/A%20performance%20comparison%20of%20metaheuristics%20search%20for%20university%20course%20timetabling%20problems_ABSTRACT.pdf https://eprints.ums.edu.my/id/eprint/29044/3/A%20performance%20comparison%20of%20metaheuristics%20search%20for%20university%20course%20timetabling%20problems.pdf https://eprints.ums.edu.my/id/eprint/29044/ https://www.researchgate.net/publication/322098485_A_Performance_Comparison_of_Metaheuristics_Search_for_University_Course_Timetabling_Problems http://dx.doi.org/10.1166/asl.2017.10209 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Malaysia Sabah |
| Language: | English English |
| Summary: | 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. |
|---|