基于二叉知识树推理的可扩展智能排课系统  

Extensible Intelligent Scheduling System Based on Two Fork Knowledge Tree Reasoning

作　　者：王运成 周春华 陈楚湘 吴善明[1] 陈冰 WANG Yuncheng;ZHOU Chunhua;CHEN Chuxiang;WU Shanming;CHEN Bing(Information Operations Command Department,Strategic Support Force Information Engineering University,Zhengzhou 450001,China)

机构地区：[1]战略支援部队信息工程大学信息作战指挥系,郑州450001

出　　处：《计算机工程与应用》2021年第5期251-257,共7页Computer Engineering and Applications

基　　金：国家自然科学基金(81674098)。

摘　　要：针对高等院校整体教学资源条件下的复杂多约束、多目标组合优化排课问题,提出了一种基于二叉树知识推理的可扩展智能排课算法并进行系统研发。结合实际教学过程中涉及的课程、时间、专业、教室、教师和可信度模型进行定义,构建了智能排课模型,设计了系统结构和排课算法。原型系统利用不确定性推理巧妙地解决了排课过程中棘手的软约束问题,并将二叉知识树引入知识库存储结构以解决系统的灵活性和可扩展性问题,使原型系统能够适应动态大规模排课需求。In view of the complex multi-constraint and multi-objective combinatorial optimization scheduling problem under the condition of overall teaching resources in colleges and universities,an extensible intelligent scheduling algorithm based on two fork knowledge tree reasoning is proposed and developed in this paper.Combined with the definition of curriculum,time,specialty,classroom,teacher and credibility model,the intelligent course scheduling model is constructed,and the system structure and scheduling algorithm are designed.The prototype system using uncertainty reasoning skillfully solves the soft constraint problem in the course of the course scheduling,and introduces two fork knowledge tree into knowledge storage structure to solve the problem of flexibility and extensibility of the system,so that the prototype system can adapt to the needs of dynamic large-scale scheduling.

关 键 词：二叉知识树 不确定性推理 智能排课 可信度 

分 类 号：TP273[自动化与计算机技术—检测技术与自动化装置]