科研之友
微信
新浪微博
Facebook
分享链接
摘要
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.
