Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings
International Conference on Advanced Computer Theory and Engineering (ICACTE 2009)
Xie Yi
Xie Yi
Search for other works by this author on:
No. of Pages:
ASME Press
Publication date:

A novel meta-heuristic algorithm that is based on the principles of particle swarm optimization (PSO) is proposed for course scheduling problem. In the original PSO algorithm, particles search solutions in a continuous solution space. Since the solution space of the course scheduling problem is discrete, this study incorporates a local search method into the proposed PSO in order to explore a better solution improvement. The simulation results demonstrate that the proposed PSO in this study can significantly reduce the amount of computation required for course scheduling, and yields an optimal satisfaction of course scheduling for instructors and class scheduling arrangements.

Key Words
1. Introduction
2. Problem Description for UCSP
3. Particle Swarm Optimization and UCSP
4. Computational Results
5. Conclusions
This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal