Metaheuristic algorithms for building Covering Arrays: A review

Metaheuristic algorithms for building Covering Arrays: A review

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...

Full description

Bibliographic Details
Main Authors: Jimena Adriana Timaná-Peña, Carlos Alberto Cobos-Lozada, Jose Torres-Jimenez
Format: Article
Language:English
Published: Universidad Pedagógica y Tecnológica de Colombia 2016-09-01
Series:Revista Facultad de Ingeniería
Subjects:
ant colony optimization
Covering Array
genetic algorithms
harmony search algorithm
metaheuristics
particle swarm optimization
simulated annealing
tabu search
Online Access:http://revistas.uptc.edu.co/index.php/ingenieria/article/view/5295

Internet

http://revistas.uptc.edu.co/index.php/ingenieria/article/view/5295

Similar Items