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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
