Infeasibility In Automated Test Assembly Models A Comparison Study Of Different Methods
Door: Huitzing, H.A., Veldkamp, B.P., Verschoor, A.J. | 01-01-2004 Several techniques exist to automatically put together a test meeting a number of specifications. In an item bank, the items are stored with their characteristics.A test is constructed by selecting a set of items that fulfills the specifications set by the test assembler. Test assembly problems are often formulated in terms of a model consisting of restrictions and an objective to be maximized or minimized. A problem arises when it is impossible to construct a test from the item pool that meets all specifications, that is, when the model is not feasible. Several methods exist to handle these infeasibility problems.
In this paper, test assembly models resulting from two practical testing programs were reconstructed to be infeasible. These models were analyzed using methods that either forced a solution (Goal programming, Multiple-Goal programming, Greedy Heuristic), that analyzed the causes (Relaxed and Ordered Deletion Algorithm, Integer Randomized Deletion Algorithm, Set Covering and Item Sampling), or that analyzed the
causes and used this information to force a solution (Irreducible-Infeasible-Set Solver). Specialized methods like the Integer Randomized Deletion Algorithm, and the Irreducible-Infeasible-Set-Solver performed best. Recommendations about the use of different methods are given.
Kunnen we je helpen?
Stel je vraag via onze kanalen of kijk in de veelgestelde vragen.
Voor scholen: Vergeet niet om het brinnummer bij de hand te hebben en/of in de mail te vermelden, zodat we jouw vraag sneller kunnen behandelen!