Metaheuristic post-optimization of the NIST repository of covering arrays | Zendy

José Torres-Jiménez | Zendy; Arturo Rodríguez-Cristerna | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Metaheuristic post-optimization of the NIST repository of covering arrays

Author(s) -

José Torres-Jiménez,

Arturo Rodríguez-Cristerna

Publication year - 2017

Publication title -

caai transactions on intelligence technology

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.613

H-Index - 15

eISSN - 2468-6557

pISSN - 2468-2322

DOI - 10.1016/j.trit.2016.12.006

Subject(s) - nist , metaheuristic , redundancy (engineering) , simulated annealing , ant colony optimization algorithms , row , reducer , combinatorial optimization , computer science , detector , algorithm , mathematical optimization , engineering , mathematics , reliability engineering , database , mechanical engineering , natural language processing , telecommunications

Construction of Covering Arrays (CA) with minimum possible number of rows is challenging. Often the available CA have redundant combinatorial interaction that could be removed to reduce the number of rows. This paper addresses the problem of removing redundancy of CA using a metaheuristic post-optimization (MPO) approach. Our approach consists of three main components: a redundancy detector (RD); a row reducer (RR); and a missing-combinations reducer (MCR). The MCR is a metaheuristic component implemented using a simulated annealing algorithm. MPO was instantiated with 21,964 CA taken from the National Institute of Standards and Technology (NIST) repository. It is a remarkable result that this instantiation of MPO has delivered 349 new upper bounds for these CA.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research