n元蚁群算法求解组卷问题  

n multiple ant colony algorithm for composing test paper problem

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

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

出　　处：《计算机工程与应用》2008年第19期223-226,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(the National Natural Science Foundation of China under Grant No.60272034;No.60472099);浙江省自然科学基金(the Natural Science Foundation of Zhejiang Province of China under Grant No.Y106080)

摘　　要：组卷问题是一个多约束目标问题的求解。通过分析组卷的数学模型及目标函数,抽象出组卷模型实质是一个多目标线性规划模型,并在二元蚁群算法基础上,设计了一种求解组卷问题的n元蚁群算法,并与贪心算法相结合,对非法个体进行合理化修正。实验结果表明,该算法很好的解决了一次产生多套满足要求的标准化试卷,具有较强的实用性。The test paper problem is to be solved with multi-target constraints.Through analyzing the mathematical model and objective function of the test paper problem,this article abstracts that the composing test paper model is really a multi-objective linear programming model.On the basis of the binary ant colony algorithm,a n multiple ant colony algorithm is designed for the problem,also the greedy algorithm is involved to revise the illegal individuals.Experiments show that the algorithm can solve the producing of the multiple sets of standardized papers effectively and it also has the more capability and utility .

关 键 词：n元蚁群算法 多目标线性规划模型 试题组卷 贪心算法 

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