Timetable Scheduling Using Particle Swarm Optimization

Authors:
Shu-Chuan Chu;Yi-Tin Chen;Jiun-Huei Ho
Affiliations:
Cheng-Shiu University, Taiwan;Cheng-Shiu University, Taiwan;Cheng-Shiu University, Taiwan
Venue:
ICICIC '06 Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 3
Year:
2006

Citing 0
Cited 9

Staff Scheduling with Particle Swarm Optimisation and Evolution Strategies

EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
University course timetable planning using hybrid particle swarm optimization

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Particle swarm optimization for constrained instruction scheduling

VLSI Design
Scheduling meetings in distance learning

APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Automatic generation of optimised working time models in personnel planning

ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Solving effectively the school timetabling problem using particle swarm optimization

Expert Systems with Applications: An International Journal
Particle swarm optimization and an agent-based algorithm for a problem of staff scheduling

EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
A hybrid particle swarm optimization based algorithm for high school timetabling problems

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.