Test Paper Problem Solved by Binary Ant Colony Algorithm

Through analyzing the mathematical model and objective function of the composing test paper, this article abstracts that the composing test paper model is really a multi-objective linear programming model, and the binary ant colony algorithm is introduced to solve the problem. Owning to the adoption of the binary coding, each ant chooses 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 is lower, so the corresponding memory is relatively less. Experimental results demonstrate that the algorithm can solve the test paper problem quickly and effectively, and also has practical value.