一种基于策略集的概率缩域算法对多目标随机组卷问题的解决方案  

A Solution of Multiple Target and Random E-examination Paper Based on Random and Reduce Range Algorithm to Strategy Set

作　　者：周华君[1] 丁爱芬[1] 吕小俊[1] 

机构地区：[1]云南大学旅游文化学院,云南丽江674100

出　　处：《计算机与现代化》2018年第2期80-83,共4页Computer and Modernization

摘　　要：电子考试系统的组卷研究是高校教考改革中电子试卷需要考虑的综合性问题。电子组卷既要求算法具有高效性、随机性和均衡性,同时需要抽取的试题组合满足用户自定义策略性要求。本文提出一种基于策略集的概率缩域算法,首先通过对试题组和组卷过程采用随机洗牌算法,保证试题抽取的随机性;其次使用策略集对试题取值域进行提前剪枝,缩小当前目标集的取值范围,保障算法的快速返回;最后使用策略集对抽取目标集进行轮转,实现基于策略的试题调整。在一个具有100000个题目的试题库中抽取1000份试卷的测试结果表明,算法能够在极短时间内(127 s)抽取符合目标的试题量,算法效率与组卷份数呈现二次函数的变化趋势,对题库数量敏感度较小,适合较大题库的试卷抽取工作。Research on generating test paper in electronic examination system（ E-Exam System） remains a comprehensive problem in teaching and examination reform of colleges and universities because it requires high efficiency,randomness and balance in algorithm,meanwhile the extracting test paper combination should meet the users＇ custom sets strategy. This paper presents a strategy-sets-based reduce range of algorithm＇s parameters,which firstly applies a random shuffle algorithm towards test papers and the process of generating test papers to guarantee the randomness of abstracting test questions; then prunes the value domain ahead of time by using strategy sets and reduces the value range of the current target set to ensure fast return of algorithm; finally rotates the abstracting targets with strategy sets to realize test paper adjustment based on strategies. After the test of abstracting1000 test papers from a 100000 questions Test Bank,this algorithm shows the following features： it can abstract item quantity accord to the goal within very short time（127 s）; algorithm efficiency and the number of test paper composition show a variation trend of quadratic function; it has less sensitiveness towards the number of questions in test bank so this algorithm is suitable for a relatively large test bank.

关 键 词：随机洗牌 轮转 策略集 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]