| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652088 | Electronic Notes in Discrete Mathematics | 2015 | 8 Pages |
Abstract
The construction of Mixed Covering Arrays (MCA) with the minimum number of rows has been a problem faced in different ways. This paper aims to construct near optimal MCAs through a novel approach based on Simulated Annealing (SA) and Variable Neighborhood Search (VNS). The solution quality of the proposed algorithm was measured by solving two benchmarks and the obtained results show a significant quality improvement over the results of previously reported metaheuristics.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
