Comparison using Particle Swarm Optimization and Genetic Algorithm for Timetable Scheduling

Lecturer timetable scheduling is an important part in the resource allocation planning. Due to the large amount of transactions and various related constraints have to be taken into account in timetable scheduling process, resource manager team shall need a lot of time to the solve the problem. This research is aimed to discuss the application of Particle Swarm Optimization (PSO) that can be used to automatically generate optimal lecturer timetable scheduling. Using Software Laboratory Center (SLC) data, some hard constraints are taken into account such as the assistant should teach according to their qualifications, teaching in their work shift and doesn’t teach any course that are being taken. Some soft constraints are also considered and the associated cost function is built based on these hard and soft constraints. Based on the computational results, the amount of penalty obtained by the PSO is much smaller than the GA on 500th iteration. The calculation is performed by comparing the amount of penalty that earned each time a hard constraint or soft constraint is violated by the implementation of PSO or GA to the total penalty obtained when all constraints are violated.

[1]  D. de Werra,et al.  An introduction to timetabling , 1985 .

[2]  Dominique de Werra,et al.  Restricted coloring models for timetabling , 1997, Discret. Math..

[3]  Deris Safaai,et al.  A Combination of PSO and Local Search in University Course Timetabling Problem , 2009, 2009 International Conference on Computer Engineering and Technology.

[4]  A. Hertz.  Tabu search for large scale timetabling problems , 1991 .

[5]  Antariksha Bhaduri.  University Time Table Scheduling Using Genetic Artificial Immune Network , 2009, 2009 International Conference on Advances in Recent Technologies in Communication and Computing.

[6]  Lien Fu Lai,et al.  An Artificial Intelligence Approach to Course Timetabling , 2006, 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06).

[7]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[8]  Jacques A. Ferland,et al.  Timetabling problem for university as assignment of activities to resources , 1985, Comput. Oper. Res..

[9]  D. de Werra,et al.  Extensions of coloring models for scheduling purposes , 1996 .

[10]  Andries Petrus Engelbrecht,et al.  Particle swarm optimization with spatially meaningful neighbours , 2008, 2008 IEEE Swarm Intelligence Symposium.

[11]  Mohammed Azmi,et al.  A hybrid harmony search for university course timetabling , 2009 .

[12]  Safaai Deris,et al.  Timetable planning using the constraint-based reasoning , 2000, Comput. Oper. Res..

[13]  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).

[14]  Marco Dorigo,et al.  Genetic Algorithms and Highly Constrained Problems: The Time-Table Case , 1990, PPSN.