基于蟻群算法的電子化考試考場(chǎng)座位編排方法
xuebao.nuc.edu.cn
摘 要： 提出一種用于電子化考試考場(chǎng)坐位優(yōu)化編排的智能算法. 在分析電子化考試特點(diǎn)的基礎(chǔ)上, 建立了考場(chǎng)編排的優(yōu)化函數(shù)和與之對(duì)應(yīng)的二分圖模型, 采用蟻群算法對(duì)該模型進(jìn)行了優(yōu)化求解. 仿真結(jié)果表明: 所提算法是有效的, 大大提高了大規(guī)模電子化考試的效率.
關(guān)鍵詞： 大規(guī)模電子化考試； 考場(chǎng)座位編排； 二分圖； 蟻群算法
中圖分類(lèi)號(hào)： TP18; TP301.6 文獻(xiàn)標(biāo)識(shí)碼: A
Electronic Examination Seat Optimization Arrangement Based on Ant Algorithm
AN Xiao-dong1,2
(1. School of Mechatronic Engineering， Beijing Institute of Technology, Beijing 100081, China；
2. Shanxi Personnel Testing Authority， Taiyuan 030006, China)
Abstract: An intellectualized algorithm for electronic examination seat optimization arrangement was presented. After analyzing the characters of electronic examination, the optimal function and bidirectional graph model of examination seat arrangement were set up. Ant algorithm was used to get the optimal solution. Simulation results show the validity of this method for solving examination seat optimization arrangement in large-scale electronic examination.
Key words: large-scale electronic exanimation; examination seat arrangement; bidirectional graph; ant algorithm
參考文獻(xiàn):
[1] Colorni A, Dorigo M, Maniezzo V, et al. Distributed optimization by ant colonies[C]. Proceedings of the 1st European Conference on Artificial Life, 1991: 134-142.
[2] Dorigo M,
