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

Ausführliche Beschreibung

Bibliographische Detailangaben
Hauptverfasser:	Timaná-Peña, Jimena Adriana, Cobos-Lozada, Carlos Alberto, Torres-Jimenez, Jose
Format:	Online
Sprache:	eng
Veröffentlicht:	Universidad Pedagógica y Tecnológica de Colombia 2016
Schlagworte:	ant colony optimization Covering Array genetic algorithms harmony search algorithm metaheuristics particle swarm optimization simulated annealing tabu search algoritmo de búsqueda armónica algoritmos genéticos búsqueda tabú metaheurística optimización por colonia de hormigas optimización por enjambre de partículas recocido simulado
Online Zugang:	https://revistas.uptc.edu.co/index.php/ingenieria/article/view/5295

Online

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