一种基于改进遗传算法的组卷算法  

A exam-paper generating algorithm based on improved genetic algorithm

作　　者：陈晓东[1] 王宏宇[1] 

机构地区：[1]哈尔滨工业大学机电工程学院,黑龙江哈尔滨150001

出　　处：《哈尔滨工业大学学报》2005年第9期1174-1176,1248,共4页Journal of Harbin Institute of Technology

基　　金：黑龙江省自然科学基金资助项目(F10301).

摘　　要：为了能更好地解决组卷质量和组卷速度之间的矛盾,提出了一种基于整数分段编码的遗传算法.该算法在保证组卷预期效果的前提下,不仅搜索速度快,而且能够避免遗传算法中经常出现的“早熟现象”,具有很好的收敛性和实用性.实践结果表明,该方法可以有效地解决智能组卷中的约束优化问题.A high quality test paper combination is generally at the cost of considerable time. In order to handle the contradiction between quality and speed of combination, a genetic algorithm based on integer segment is proposed in the thesis. The algorithm guarantees expected result of a test paper combination and has satisfying astringency and practicability, with not only high speed but also avoidance of prematureness phenomenon which is often arisen in genetic algorithm. Practice proves that this algorithm is able to solve the problem of restriction optimizing in the process of intellect test paper combination.

关 键 词：题库 组卷 遗传算法 约束优化 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]