Sporathe knowledge network
ES
Universidad Pedagógica y Tecnológica de Colombia

Revista Facultad de Ingeniería

Metaheuristic algorithms for building Covering Arrays: A review

Record only. The repository marks this work as “Acceso abierto”: the PDF is not public, so there is no text to read here. View the record in the repository.

Abstract

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.

Keywords