IEEE Trans Cybern. 2019 Jul;49(7):2792-2805. doi: 10.1109/TCYB.2018.2836388. Epub 2018 Jun 13.
Parallel test assembly has long been an important yet challenging topic in educational assessment. Cognitive diagnosis models (CDMs) are a new class of assessment models and have drawn increasing attention for being able to measure examinees' ability in detail. However, few studies have been devoted to the parallel test assembly problem in CDMs (CDM-PTA). To fill the gap, this paper models CDM-PTA as a subset-based bi-objective combinatorial optimization problem. Given an item bank, it aims to find a required number of tests that achieve optimal but balanced diagnostic performance, while satisfying important practical requests in the aspects of test length, item type distribution, and overlapping proportion. A set-based multiobjective particle swarm optimizer based on decomposition (S-MOPSO/D) is proposed to solve the problem. To coordinate with the property of CDM-PTA, S-MOPSO/D utilizes an assignment-based representation scheme and a constructive learning strategy. Through this, promising solutions can be built efficiently based on useful assignment patterns learned from personal and collective search experience on neighboring scalar problems. A heuristic constraint handling strategy is also developed to further enhance the search efficiency. Experimental results in comparison with three representative approaches validate that the proposed algorithm is effective and efficient.
并行测试组装长期以来一直是教育评估中的一个重要但具有挑战性的话题。认知诊断模型(CDM)是一类新的评估模型,因其能够详细测量考生的能力而受到越来越多的关注。然而,很少有研究致力于 CDM 中的并行测试组装问题(CDM-PTA)。为了填补这一空白,本文将 CDM-PTA 建模为基于子集的双目标组合优化问题。给定一个项目库,它旨在找到所需数量的测试,以实现最佳但平衡的诊断性能,同时满足测试长度、项目类型分布和重叠比例等方面的重要实际要求。提出了一种基于分解的基于集合的多目标粒子群优化算法(S-MOPSO/D)来解决这个问题。为了与 CDM-PTA 的特性相协调,S-MOPSO/D 利用了基于分配的表示方案和构建学习策略。通过这种方式,可以根据从个人和集体在邻近标量问题上的搜索经验中学习到的有用分配模式,有效地构建有前途的解决方案。还开发了一种启发式约束处理策略,以进一步提高搜索效率。与三种代表性方法的实验结果比较验证了所提出算法的有效性和高效性。