By Topic

Based on discrete particle swarm algorithm and simulated annealing algorithm to solve course timetabling problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Kuancheng Zou ; Sch. of Comput. Sci. & Eng., Changchun Univ. of Technol., Changchun, China ; Ye Qian ; Xuan Liu ; Pengfei Zhang

In this paper, course timetabling problem was referred as the research object, the objective function converted by many constraints and soft constraint condition was analyzed. Established the mathematical model, proposed discrete particle swarm algorithm and simulated annealing algorithm that combined to settle course timetabling problem, which ensured that the particles escaped from the local minimum, guaranteed that the curriculum be more close to the ideal, the experimental results showed that the better results can be obtained by the method.

Published in:

Computer, Mechatronics, Control and Electronic Engineering (CMCE), 2010 International Conference on  (Volume:1 )

Date of Conference:

24-26 Aug. 2010