Comparison of Simulated Annealing and Great Deluge Algorithms for University Course Timetabling Problems (UCTP)
This paper 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, the comparison between Simulated Annealing (SA) and Great Deluge (GD) algorithm are proposed in order to determine the scheduling performance in UMSLIC timetabling problem. The results demonstrate that both SA and GD algorithms are able to improve the quality of initial solution but the performance are vary in different datasets which may not perform the best in every domain.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
Document Type: Research Article
Affiliations: Faculty of Computing and Informatics, Universiti Malaysia Sabah, Malaysia
Publication date: November 1, 2017
More about this publication?
- ADVANCED SCIENCE LETTERS is an international peer-reviewed journal with a very wide-ranging coverage, consolidates research activities in all areas of (1) Physical Sciences, (2) Biological Sciences, (3) Mathematical Sciences, (4) Engineering, (5) Computer and Information Sciences, and (6) Geosciences to publish original short communications, full research papers and timely brief (mini) reviews with authors photo and biography encompassing the basic and applied research and current developments in educational aspects of these scientific areas.
- Editorial Board
- Information for Authors
- Subscribe to this Title
- Ingenta Connect is not responsible for the content or availability of external websites