- 无标题文档
查看论文信息

论文中文题名:

 基于偶图和智能算法的排课算法    

姓名:

 周小锋    

学号:

 04140    

保密级别:

 公开    

学科代码:

 081001    

学科名称:

 通信与信息系统    

学生类型:

 硕士    

学位年度:

 2007    

院系:

 通信与信息工程学院    

专业:

 信号与信息处理    

第一导师姓名:

 刘健    

论文外文题名:

 Course ArrangementAlgorithm Based on Bipartite-Graph and Intelligent Algorithm    

论文中文关键词:

 计算机排课 偶图 最佳匹配 遗传算法 禁忌搜索 高等教育 教务现代化    

论文外文关键词:

 Course arrangement Bipartite-graph Optimum matching    

论文中文摘要:
随着我国高等教育的大踏步发展,高校的师资、教舍相对紧张以及多校区问题使教务中的排课问题日趋严峻。计算机排课是教务现代化的要求,也是解决高校排课问题的出路,排课算法是计算机排课的核心,其好坏直接影响着计算机排课的结果和计算的复杂度。 本文将排课五要素绑定、封装成课元、课栈两个向量,并以二维权值矩阵描述课元和课栈之间的关联系。 提出了最佳匹配和遗传算法的排课算法,以随机生成的二维数字矩阵来反映课元和课栈的关联权重,对数字矩阵组处理和最佳匹配得到的匹配偶图组为遗传算法的初始种群,以排课各种原则的加权和为目标函数,在遗传算子控制下迭代来寻求更优的匹配结果即使目标函数最小的偶图匹配结构,进而得到满意的排课结果。 提出了关联匹配和禁忌搜索的排课算法,以随机二维数字矩阵描述课元和课栈之间的关联权重,按照重权优先并根据正确性原则进行约简,获得课元和课栈之间的匹配偶图。在此基础上,引入禁忌搜索算法,以排课的完备性原则、合理性原则和人性化原则的加权和为目标函数,以随机二维权值矩阵生成的匹配偶图为初始解,对二维权值矩阵进行扰动构成搜索邻域,以生成的匹配偶图为禁忌对象,采用全局藐视准则,获得最优的排课方案。 以Matlab为平台,利用Excel数据库和Matlab的互联实现数据交换,编写了两套算法的应用程序,通过实例来验证两套排课算法,结果表明两套算法是可行的。
论文外文摘要:
With the rapid development of national lligh education,cou雠arrangements bec,omc mo糟and more difficult.To meet the requirement ofeducational administration ofuniversities. arranging courses by computers is a choice of promising.Curriculum schedule algorithm plays 811 important role in c01U'Se arrangements and the quality and efficiency of R still needs to be improved. The five elements ofcurriculum schedule撇packaged into two vectors ofclass-back and class-stack.The relevance weights between the elements of class··buck and class·-stack ale described by a two dimensional matrix. An optimum matching and genetic algorithm based approach of curriculum schedule is proposed.A group of matching graphs is worked out by the optimum matching algofithm on weight matrix randomly prodaced,which forms the initial population.A genetic algorithm is then in仃oduced to obtain the finial solution with the highest quality ofcourse arrangement. A novel approach of curriculum schedule based 011 correlation matching and Tabu searching is presented.The correlmion matching process guarantees the COITectuess principle to be satisfied,based on which,Tabu searching is adopted to find the optimum solution.The weighted summation ofthe principle ofcategoricalness,rationality and humanization is used 8S the index.The initial solution is established on a random weight matrix.The neighborhood is formed by disturbing the elements ofthe weight n均lrix.respectively. A practical example is given showing the feasibility and efficiency of the proposed approaches on the platform ofMatlab,in which the dam can be used in Excel format.
中图分类号:

 TP301.6 G473.4    

开放日期:

 2011-09-06    

无标题文档

   建议浏览器: 谷歌 火狐 360请用极速模式,双核浏览器请用极速模式