Binary PSO algorithm for test paper problem

doi:10.3778/j.issn.1002-8331.2009.30.024

Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (30): 80-83.DOI: 10.3778/j.issn.1002-8331.2009.30.024

• 研发、设计、测试 • Previous Articles Next Articles

Binary PSO algorithm for test paper problem

WEI Ping¹，XIONG Wei-qing¹，WEI Ying²

1.Institute of Computer Science and Technology，Ningbo University，Ningbo，Zhejiang 315211，China
2.Gansu Golden Bridge Water and Wastewater Design & Engineering（Group）Co.，Ltd，Lanzhou 730070，China

Received:2008-08-28 Revised:2009-04-20 Online:2009-10-21 Published:2009-10-21
Contact: WEI Ping

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

魏平¹，熊伟清¹，魏颖²

1.宁波大学计算机科学与技术研究所，浙江宁波 315211
2.甘肃省金桥给水排水设计与工程（集团）有限公司，兰州 730070

通讯作者: 魏平

Abstract

Abstract: 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.

Key words: binary Particle Swarm Optimization（PSO）, cellular automata, greedy algorithm, test paper problem, multi-objective linear programming

摘要： 从一维细胞自动机模型入手，设计了一种求解二元离散优化问题的二元粒子群算法细胞自动机模型（BPSO-CA）。然后将其用来求解组卷问题，同时对BPSO-CA模型进行扩展，得到一次能产生多套有一定重复率或重复率为0的标准化试卷。仿真实验表明该模型能快速有效地完成组卷，具有较强的实用价值。

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

CLC Number:

TP301.6

WEI Ping¹，XIONG Wei-qing¹，WEI Ying². Binary PSO algorithm for test paper problem[J]. Computer Engineering and Applications, 2009, 45(30): 80-83.

魏平¹，熊伟清¹，魏颖². 一种求解组卷问题的二元粒子群算法[J]. 计算机工程与应用, 2009, 45(30): 80-83.

[1]	ZHANG Sheng, LI Yuqing, LI Yuanqingzhen. Multi-Value Cellular Automata Simulation and Application Combined with User Perception Model [J]. Computer Engineering and Applications, 2019, 55(20): 250-256.
[2]	HE Hong, CHEN Yong. HE Hong, CHEN Yong [J]. Computer Engineering and Applications, 2019, 55(14): 209-214.
[3]	ZHANG Nana, ZHAO Zuopeng, LI Xiaobo. Non-uniform node distribution routing protocol adopted semi-greedy optimization idea [J]. Computer Engineering and Applications, 2017, 53(23): 60-66.
[4]	ZHANG Xiaobing, ZHU Liling, YANG Da. Characteristics of car-truck traffic flow on up-slope based on CA model [J]. Computer Engineering and Applications, 2017, 53(19): 216-223.
[5]	WU Lixin, ZHENG Jeffrey. Visual analysis of classification of cellular automata based on variant coding scheme [J]. Computer Engineering and Applications, 2017, 53(10): 160-164.
[6]	ZHU Xu, NIU Cunliang, BAI Xiaoli. Improved ZigBee tree routing algorithm [J]. Computer Engineering and Applications, 2016, 52(5): 114-118.
[7]	LIN Ruonan, LI Qiang. Template-based task scheduling strategy and algorithm in cloud computing environment [J]. Computer Engineering and Applications, 2016, 52(19): 48-52.
[8]	WANG Chaobin1, MAO Qianren2, XIANG Ting3, DENG Chao2. Mobile cellular automata of individualized network public opinion clustering model and simulation [J]. Computer Engineering and Applications, 2016, 52(19): 122-127.
[9]	HU Zhifei, DUAN Zhongxing, CHEN Sheng, LIU Yang. Study on guiding role of evacuation lighting and directing system of subway station [J]. Computer Engineering and Applications, 2016, 52(15): 237-242.
[10]	LIN Huazhou, ZHANG Dakun, HUANG Cui. Research on low-power mapping for three-dimensional network-on-chip based on inproved genetic algorithm [J]. Computer Engineering and Applications, 2016, 52(1): 76-80.
[11]	MOU Lianming1，2, LUO Kaibao1, CHEN Lin1, LUO Shiming1. Semi-automatic visualization stitching method of image fragments [J]. Computer Engineering and Applications, 2016, 52(1): 206-209.
[12]	LIU Xiaobin, YANG Guanzhong, OUYANG Liubo, LI Yongjun. Research in dynamic evolution of software architectures based on cellular automata model [J]. Computer Engineering and Applications, 2015, 51(9): 87-92.
[13]	WEN Xingzi1, LIU Youjin1, OUYANG Junlin2. Simulating software trustworthiness evolution based on moving cellular automata [J]. Computer Engineering and Applications, 2015, 51(7): 12-17.
[14]	HUANG Shuli, HU Dasha, JIANG Yuming. Algorithm for finding shortest path which must go through specified intermediate node set [J]. Computer Engineering and Applications, 2015, 51(11): 41-46.
[15]	ZHAO　Yanxin, WANG Xiaoming, LI Li. Virus spreading model on complex networks based on cellular automata [J]. Computer Engineering and Applications, 2015, 51(10): 117-122.

Binary PSO algorithm for test paper problem

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

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics