DocumentCode
2526148
Title
Timetable Scheduling Using Particle Swarm Optimization
Author
Chu, Shu-Chuan ; Chen, Yi-Tin ; Ho, Jiun-Huei
Author_Institution
Dept. of Inf. Manage., Cheng-Shiu Univ., Kaohsiung
Volume
3
fYear
2006
fDate
Aug. 30 2006-Sept. 1 2006
Firstpage
324
Lastpage
327
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
Keywords
constraint theory; education; particle swarm optimisation; scheduling; NP-completeness problem; constraint satisfaction; discrete problem; education; particle swarm optimization; timetable scheduling; Algorithm design and analysis; Birds; Evolutionary computation; Genetic algorithms; Information management; Marine animals; Particle swarm optimization; Processor scheduling; Scheduling algorithm; Transportation;
fLanguage
English
Publisher
ieee
Conference_Titel
Innovative Computing, Information and Control, 2006. ICICIC '06. First International Conference on
Conference_Location
Beijing
Print_ISBN
0-7695-2616-0
Type
conf
DOI
10.1109/ICICIC.2006.541
Filename
1692180
Link To Document