University Course Timetabling using Bayesian based Optimization Algorithm
<p>The timetabling problem has traditionally been treated as a mathematical optimization, heuristic, or human-machine interactive problem. The timetabling problem comprises hard and soft constraints. Hard constraints must be satisfied in order to generate feasible solutions. Soft constraints a...
Main Authors: | Alinaswe Siame, Douglas Kunda |
---|---|
Format: | Article |
Language: | English |
Published: |
International Association of Online Engineering (IAOE)
2018-08-01
|
Series: | International Journal of Recent Contributions from Engineering, Science & IT |
Online Access: | http://online-journals.org/index.php/i-jes/article/view/8990 |
Similar Items
-
Evolution of PHP Applications: A Systematic Literature Review
by: Alinaswe Siame, et al.
Published: (2017-03-01) -
Genetic algorithms for university course timetabling problems
by: Naseem Jat, Sadaf
Published: (2012) -
An Evaluation of the Great Deluge Algorithm in Course Timetabling : As Applied to the KTH-Inspired University Course Timetabling Problem
by: Chammas, Kristoffer, et al.
Published: (2019) -
Designing an Automated Timetable for University Courses Using Genetic Algorithms
by: A.H. Monajemi, et al.
Published: (2009-12-01) -
A harmony search algorithm for university course timetabli
by: Al-Betar, Mohammed Azmi, et al.
Published: (2012)