A Study on PSO-Based University Course Timetabling Problem

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.

[1]  A. Najafi-Ardabili,et al.  Finding Feasible Timetables with Particle Swarm Optimization , 2007, 2007 Innovations in Information Technologies (IIT).

[2]  Peng-Yeng Yin,et al.  A particle swarm optimization approach to the nonlinear resource allocation problem , 2006, Appl. Math. Comput..

[3]  Shu-Chuan Chu,et al.  Timetable Scheduling Using Particle Swarm Optimization , 2006, First International Conference on Innovative Computing, Information and Control - Volume I (ICICIC'06).

[4]  Sumitra Mukherjee,et al.  Evaluating particle swarm intelligence techniques for solving university examination timetabling problems , 2006 .

[5]  Marin Golub,et al.  Solving timetable scheduling problem using genetic algorithms , 2003, Proceedings of the 25th International Conference on Information Technology Interfaces, 2003. ITI 2003..

[6]  Hany Taher,et al.  The development of reactive constraint agent for the dynamic timetabling problem , 2003 .

[7]  Puteh Saad,et al.  Incorporating constraint propagation in genetic algorithm for university timetable planning , 1999 .

[8]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.