Deris, Safaai and Sheau Irene, Fen Ho (2009) A study on PSO-based university course timetabling problem. In: Proceedings - International Conference on Advanced Computer Control, ICACC 2009. Article number 4777422 . Elsevier, pp. 648-651. ISBN 978-076953516-6
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1109/ICACC.2009.112
In university timetabling problems, course subjects must be assigned to a certain timeslots and rooms that satisfy preferred constraints. Timetabling problem is NP-completeness problem, which is a difficult problem with a lot of constraints to be solved and a huge search space needed to be explored if the problem size increases. As Particle Swarm Optimization (PSO) has many successful applications in continuous optimization problems, the main contribution of this paper is to utilize PSO to solve the discrete problem of University Course Timetable (UCT). Experimental results confirm that PSO able to solve the timetabling problem with promising result.
|Item Type:||Book Section|
|Additional Information:||Proceedings - International Conference on Advanced Computer Control, ICACC 2009;|
|Uncontrolled Keywords:||timetabling problems, university course|
|Subjects:||L Education > LB Theory and practice of education > LB2300 Higher Education|
Q Science > QA Mathematics > QA76 Computer software
|Divisions:||Computer Science and Information System (Formerly known)|
|Deposited By:||Ms Zalinda Shuratman|
|Deposited On:||06 Jul 2011 01:27|
|Last Modified:||07 Jul 2011 04:33|
Repository Staff Only: item control page