一种基于回溯试探法组卷的优化算法
CSTR:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

国家自然科学基金(71373203)


An Optimization Algorithm Based on Backtracking Search Method
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    针对回溯试探法在题库试题数量较大的情况下,组卷效率低的问题,提出目标终止回溯试探法和缩减深 度回溯试探法2 种改进的算法。通过建立改进的回溯试探法组卷算法模型,对2 种改进算法在组卷效率适用性方面 进行分析,并对改进的回溯试探法进行实验验证。实验结果表明:2 种改进算法在组卷效率上都有明显地提高,并 且各有特点及适应性;如果数据量巨大,适用缩减深度回溯试探法,否则适用目标终止回溯试探法。

    Abstract:

    In view of the problem that the backtracking search method has a low efficiency of paper-generating under the condition of a large number of test questions, this paper proposes 2 improved algorithms: the target termination backtracking search method and the reduced depth backtracking search method. Through building the model of the improved backtracking search method paper-generating algorithm, the paper analyzed the applicability of the 2 improved algorithms in the paper-generating efficiency and verified the improved backtracking search method. The experimental results show that the 2 improved algorithms are obviously improved in the efficiency of the paper-generating, and each has its own characteristics and adaptability. If the amount of data is huge, the reduced depth backtracking search method is applicable, otherwise, the target termination backtracking search method is applied.

    参考文献
    相似文献
    引证文献
引用本文

李 川.一种基于回溯试探法组卷的优化算法[J].,2019,38(02).

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2018-10-15
  • 最后修改日期:2018-11-22
  • 录用日期:
  • 在线发布日期: 2019-03-25
  • 出版日期:
文章二维码