利用遗传算法实现试题库自动组卷问题  

Testpaper Auto-Assembling from Question Database on Genetic Algorithm

作　　者：孟祥娟[1] 王俊峰 曹锦梅[1] 

机构地区：[1]新疆医科大学高职学院,新疆乌鲁木齐8300541 [2]新疆信息产业厅,新疆乌鲁木齐8300112

出　　处：《计算机系统应用》2010年第1期180-184,共5页Computer Systems & Applications

基　　金：国家"十一五"科技支撑计划(2006BAD10A15)

摘　　要：提出并实现了利用遗传算法求解试题库组卷的数学模型,定义了组卷问题的适应度函数,讨论了运用遗传算法求解在一定约束条件下的多目标参数优化问题,通过初始化种群、选择算子、交叉算子和变异算子,等过程不断进化,最后得到最优解,实验结果表明,遗传算法相对于其它算法更能有效的解决试题库自动组卷问题,提出了实现不相邻试卷分配的补遗随机算法,为求解类似的多目标约束问题及不相邻组合问题提供一种新的方法。The paper introduces a mathematical model of testpaper assembling on genetic algorithm,defines an adaptive function on testpaper assembling,and provides some ideas on multi-object parameter optimization on restricted terms by genetic algorithm.In the evolutionary processes of seeds initialization,operators selecting,operator crossing,operation differentiation,the best solution is finally worked out.Results of experiments indicate,genetic algorithm is more efficient than other algorithms on testpaper auto-assembling. Random algorithm which could achieves testpaper non-adjacency distribution,is a new method for similar multi-object restriction and non-adjacency combination problems.

关 键 词：遗传算法 随机算法 自动组卷 试题库 多目标约束 

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