[1]ADEWUMI A O, SAWYERR B A, MONTAZ A M. A heuristic solution to the university timetabling problem [J]. Engineering Computations, 2009, 26(8): 972-984.[2]EVEN S, ITAI A, SHAMIR A. On the complexity of time table and multi-commodity flow problems [J]. SIAM Journal on Computing, 1976, 5(4): 691-703.[3]程学先,祝苏薇.一种基于动态规划的课程调度算法的研究与实现[J].武汉理工大学学报:交通科学与工程版,2006,30(3):485-488.[4]车明,秦存秀,刘凯.基于改进回溯算法的计算机排课系统[J].沈阳工业大学学报,2006,28(6):667-670.[5]SELIM S M. Split vertices in vertex colouring and their application in developing a solution to the faculty timetable problem [J]. The Computer Journal, 1988, 31(1): 76-82.[6]邓曦辉.浅谈贪心算法在排课系统中的应用[J].电脑与电信,2011(7):29-30.[7]梁艳春,吴春国,时小虎,等.群智能优化算法理论与应用[M].北京:科学出版社,2009.[8]KENNEDY J, EBERHART R C. Particle swarm optimization [C]// Proceedings of IEEE International Conference on Neutral Networks. Piscataway: IEEE Press, 1995: 1942-1948.[9]KENNEDY J, EBERHART R C. A discrete binary version of the particle swarm algorithm [C]// Proceedings of the IEEE International Conference on Systems,Man and Cybernetics. Piscataway: IEEE Press, 1997: 4104-4108.[10]WANG K P, HUANG L, ZHOU C G, et al. Particle swarm optimization for traveling salesman problem [C]// Proceedings of the IEEE International Conference on Machine Learning and Cybernetics. Piscataway: IEEE Press, 2003: 1583-1585.[11]SHI X H, XING X L, WANG Q X, et al. A discrete PSO method for generalized TSP problem [C]// Proceedings of the Third International Conference on Machine Learning and Cybernetics. Piscataway: IEEE Press, 2004: 2378-2383.[12]吕振肃,侯志荣.自适应变异的粒子群优化算法[J].电子学报,2004,32(3):416-420. |