Loading...
Loading...

Go to the content (press return)

Variable neighborhood search heuristics for a test assembly design problem

Author
Pereira, J.; Vila, M.
Type of activity
Journal article
Journal
Expert systems with applications
Date of publication
2015-06-15
Volume
42
Number
10
First page
4805
Last page
4817
DOI
https://doi.org/10.1016/j.eswa.2015.01.057 Open in new window
Repository
http://hdl.handle.net/2117/28210 Open in new window
URL
http://www.sciencedirect.com/science/article/pii/S0957417415000809# Open in new window
Abstract
Test assembly design problems appear in the areas of psychology and education, among others. The goal of these problems is to construct one or multiple tests to evaluate the test subject. This paper studies a recent formulation of the problem known as the one-dimensional minimax bin-packing problem with bin size constraints (MINIMAX_BSC). In the MINIMAX_BSC, items are initially divided into groups and multiple tests need to be constructed using a single item from each group, while minimizing dif...
Citation
Pereira, J.; Vila, M. Variable neighborhood search heuristics for a test assembly design problem. "Expert systems with applications", 15 Juny 2015, vol. 42, núm. 10, p. 4805-4817.
Keywords
Bin packing, Test assembly design, Test splitting, Variable neighborhood search
Group of research
OPE-PROTHIUS -

Participants

Attachments