Variable neighborhood search heuristics for a test assembly design problem

作者：

Highlights：

• A test assembly design problem is investigated.

• The computational complexity of the problem is studied.

• We propose different neighborhoods and a variable neighborhood search method to solve the problem.

• The results obtained from the previous algorithms outperform the results found in the literature.

摘要

•A test assembly design problem is investigated.•The computational complexity of the problem is studied.•We propose different neighborhoods and a variable neighborhood search method to solve the problem.•The results obtained from the previous algorithms outperform the results found in the literature.

论文关键词：Bin packing,Test assembly design,Test splitting,Variable neighborhood search

论文评审过程：Available online 4 February 2015.

论文官网地址：https://doi.org/10.1016/j.eswa.2015.01.057