检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]燕山大学信息科学与工程学院,河北秦皇岛066004
出 处:《燕山大学学报》2007年第4期364-367,共4页Journal of Yanshan University
摘 要:针对目前传统选题算法在大型题库中选题效率低、质量不高的情况,给出了一个多约束条件下的选题问题模型,提出基于Tabu搜索算法的选题算法。依据Tabu搜索算法的集中和扩散两个策略,避开局部最大值,以最短时间寻找最优解,从而满足组卷要求。实验结果表明,该算法能有效准确的满足从大型试题库选题,其收敛速度和选题质量都有显著提高。Previous investigation has shown that the conventional algorithms in selecting test items from a large item bank were inefficient and poor quality. According to the item selecting question model of multiple assessment criteria, a Tabu search-based item selecting algorithm is proposed. Based on its concentrated and diffused strategy, the approach can avoid local maximum while meeting demand of composing test sheets. Experimental results indicated that this algorithm is more effective and accurate in selecting items from large item banks, and its convergence rate and item selecting quality have a distinct improvement.
分 类 号:O212.1[理学—概率论与数理统计]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28