基于背包问题的在线组卷算法

Algorithm of On-line Generating Paper Based on Knapsack Problem

针对当前计算机在线自动组卷效率低和效果不理想的问题,提出一种基于背包问题求解的组卷算法,并改进了传统的背包问题求解思想:即按照题型和难度将试卷大包划分成试卷小包,进而分别求解,利用背包问题求解其过程。实验表明,算法可根据专家设计的组卷策略自动生成试卷,效率和成功率都是比较理想的。

Because of unsatisfied efficiency and effect of the current on-line auto-generating paper,an algorithm of auto-generating paper based on KP（Knapsack Problem） is presented and the conventional method of solving KP is improved,that is,paper is separated into small bags according to item＇s type and its difficulty and solved respectively by process of the solution to KP.The experiments show that the algorithm can auto-generate paper in terms of the strategy of generating paper made by experts and the algorithm is perfect in its efficiency and its rate of success.