| 一种基于改进遗传算法的组卷算法 |
| |
| 引用本文： | 陈晓东,王宏宇.一种基于改进遗传算法的组卷算法[J].哈尔滨工业大学学报,2005,37(9):1174-1176,1248. |
| |
| 作者姓名： | 陈晓东 王宏宇 |
| |
| 作者单位： | 哈尔滨工业大学,机电工程学院,黑龙江,哈尔滨,150001 |
| |
| 基金项目： | 黑龙江省自然科学基金资助项目（F0301）. |
| |
| 摘 要： | 为了能更好地解决组卷质量和组卷速度之间的矛盾，提出了一种基于整数分段编码的遗传算法．该算法在保证组卷预期效果的前提下，不仅搜索速度快，而且能够避免遗传算法中经常出现的“早熟现象”，具有很好的收敛性和实用性．实践结果表明，该方法可以有效地解决智能组卷中的约束优化问题．
|
| 关 键 词： | 题库 组卷 遗传算法 约束优化 |
| 文章编号： | 0367-6234（2005）09-1174-03 |
| 收稿时间： | 2004-12-15 |
| 修稿时间： | 2004年12月15 |
A exam-paper generating algorithm based on improved genetic algorithm |
| |
| CHEN Xiao-dong,WANG Hong-yu.A exam-paper generating algorithm based on improved genetic algorithm[J].Journal of Harbin Institute of Technology,2005,37(9):1174-1176,1248. |
| |
| Authors: | CHEN Xiao-dong WANG Hong-yu |
| |
| Abstract: | 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. |
| |
| Keywords: | item bank auto-generating exam-paper genetic algorithm constrained optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
