一种求解组卷问题的二元粒子群算法  

Binary PSO algorithm for test paper problem

作　　者：魏平[1] 熊伟清[1] 魏颖 

机构地区：[1]宁波大学计算机科学与技术研究所,浙江宁波315211 [2]甘肃省金桥给水排水设计与工程(集团)有限公司,兰州730070

出　　处：《计算机工程与应用》2009年第30期80-83,97,共5页Computer Engineering and Applications

基　　金：国家自然科学基金No.60472099;浙江省自然科学基金No.Y106080~~

摘　　要：从一维细胞自动机模型入手,设计了一种求解二元离散优化问题的二元粒子群算法细胞自动机模型(BPSO-CA)。然后将其用来求解组卷问题,同时对BPSO-CA模型进行扩展,得到一次能产生多套有一定重复率或重复率为0的标准化试卷。仿真实验表明该模型能快速有效地完成组卷,具有较强的实用价值。Starting with the one dimension cellular automata model,a kind of binary PSO cellular automata model used to solve the binary discrete optimization problem is designed.The model is involved to solve the test paper problem,and then is expanded, which is introduced to produce multiple sets of standardized papers.Experimental results show that the solving process of the test paper problem can be completed quickly and efficiently,and it also has more capability and utility.

关 键 词：二元粒子群算法 细胞自动机 贪心算法 组卷问题 多目标线性规划 

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