摘要
针对高校排课面临的问题和挑战,通过分析排课问题的约束条件,将解决排课问题转化为二分图匹配的问题,并给出优化蚁群算法方案,探索高校排课问题的优化策略。
Course Scheduling problems and challenges for the university, through the analysis of the constraints of the course timetabling problem will solve the course timetabling problem is transformed into a bipartite graph matching problem, and gives the ant colony algorithm program to explore the optimization strategy of the university course timetabling problem.
出处
《计算机与数字工程》
2012年第7期33-34,111,共3页
Computer & Digital Engineering
关键词
排课问题
蚁群算法
二分图
arrangement problem
ant colony algorithm
bipartite graph