基于二元蚁群算法求解组卷问题  

Composing test paper based on binary ant colony algorithm

作　　者：程美英[1] 熊伟清[1] 魏平[1] 

机构地区：[1]宁波大学计算机科学与技术研究所,浙江宁波315211

出　　处：《计算机应用研究》2008年第9期2637-2639,2642,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(60272034;60472099);浙江省自然科学基金资助项目(Y106080)

摘　　要：通过分析组卷的数学模型及目标函数,抽象出组卷模型实质是一个多目标线性规划模型,并将二元蚁群算法用于求解组卷问题。由于采用二进制编码,任意时刻每只蚂蚁只需根据其面前两条路径上的信息素强度决定该题选或不选,这对单个蚂蚁的智能行为要求非常低,而且存储空间也相对减少。实验结果表明,该算法能快速有效地完成组卷过程,具有较强的实用性。Through analyzing the mathematical model and objective function of the composing test paper, this article abstracted that the composing test paper model was really a multi-objective linear programming model, and introduced the binary, ant colony algorithm to solve the problem. Owning to the adoption of the binary coding, each ant chose the subject or not only need to according to the strength of the pheromone on every edge, and the requirement for the behavior of every single ant was lower, so the corresponding memory was relatively less. Experiment results show that the algorithm can solve the test paper composition problem quickly and effectively, and also has more capability and utility.

关 键 词：二元蚁群算法 多目标线性规划模型 试题组卷 进化计算 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]