First International Conference on Innovative Computing, Information and Control - Volume III (ICICIC'06) Timetable Scheduling Using Particle Swarm Optimization Beijing, China August 30-September 01 ISBN: 0-7695-2616-0
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.
Citation:
Shu-Chuan Chu, Yi-Tin Chen, Jiun-Huei Ho, "Timetable Scheduling Using Particle Swarm Optimization," icicic, vol. 3, pp.324-327, First International Conference on Innovative Computing, Information and Control - Volume III (ICICIC'06), 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb