Timetable Scheduling Using Particle Swarm Optimization

In timetable scheduling problems, examination subjects must be slotted to certain times that satisfy several of constraints. They are NP-completeness problems, which usually lead to satisfactory but suboptimal solutions. As 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 timetable scheduling. Experimental results confirm that PSO can be utilized to solve discrete problem as well.

• Type: Conference
• Year: 2006
• Where: ICICIC
• Authors: Shu-Chuan Chu, Yi-Tin Chen, Jiun-Huei Ho
• Keywords: Applied Computing, Discrete Problem, ICICIC 2006, Timetable Scheduling, Timetable Scheduling Problems