TY - JOUR AU - Timaná-Peña, Jimena Adriana AU - Cobos-Lozada, Carlos Alberto AU - Torres-Jimenez, Jose PY - 2016/09/01 Y2 - 2024/03/28 TI - Metaheuristic algorithms for building Covering Arrays: A review JF - Revista Facultad de Ingeniería JA - Rev. Fac. Ing. VL - 25 IS - 43 SE - DO - 10.19053/01211129.v25.n43.2016.5295 UR - https://revistas.uptc.edu.co/index.php/ingenieria/article/view/5295 SP - 31-45 AB - <p>Covering Arrays (CA) are mathematical objects used in the functional testing of software components. They enable the testing of all interactions of a given size of input parameters in a procedure, function, or logical unit in general, using the minimum number of test cases. Building CA is a complex task (NP-complete problem) that involves lengthy execution times and high computational loads. The most effective methods for building CAs are algebraic, Greedy, and metaheuristic-based. The latter have reported the best results to date. This paper presents a description of the major contributions made by a selection of different metaheuristics, including simulated annealing, tabu search, genetic algorithms, ant colony algorithms, particle swarm algorithms, and harmony search algorithms. It is worth noting that simulated annealing-based algorithms have evolved as the most competitive, and currently form the state of the art.</p> ER -