Based on Discrete Particle Swarm Algorithm and Simulated Annealing Algorithm to solve Course Timetabling Problem
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.
course timetabling problem discrete particleswarm algorithm simulated annealing algorithm
Kuancheng Zou Ye Qian Xuan Liu Pengfei Zhang
School of Computer Science and Engineering Changchun University of Technology Changchun, China
国际会议
长春
英文
489-492
2010-08-24（万方平台首次上网日期，不代表论文的发表时间）