Metaheuristic algorithms for building Covering Arrays: A review
Fuente:
Redalyc
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Artículo científico |
| Langue: | en |
| Publié: |
Universidad Pedagógica y Tecnológica de Colombia
2016
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1876488014681604096 |
|---|---|
| author | Jimena Adriana Timaná-Peña |
| author_facet | Jimena Adriana Timaná-Peña |
| contents | Metaheuristic algorithms for building Covering Arrays: A review Jimena Adriana Timaná-Peña Carlos Alberto Cobos-Lozada Jose Torres-Jimenez Ingeniería tabu search metaheuristics Covering Array simulated annealing genetic algorithms 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 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. 2016 artículo científico 0121-1129 https://www.redalyc.org/articulo.oa?id=413948045003 https://www.redalyc.org/journal/4139/413948045003/ https://www.redalyc.org/journal/4139/413948045003/html/ https://www.redalyc.org/journal/4139/413948045003/413948045003.epub https://www.redalyc.org/journal/4139/413948045003/movil en http://www.redalyc.org/revista.oa?id=4139 Facultad de Ingeniería application/pdf Universidad Pedagógica y Tecnológica de Colombia Facultad de Ingeniería (Colombia) Num.43 Vol.25 |
| format | Artículo científico |
| id | redalyc_413948045003 |
| institution | Redalyc |
| language | en |
| publishDate | 2016 |
| publisher | Universidad Pedagógica y Tecnológica de Colombia |
| spellingShingle | Metaheuristic algorithms for building Covering Arrays: A review Jimena Adriana Timaná-Peña Ingeniería tabu search metaheuristics Covering Array simulated annealing genetic algorithms Metaheuristic algorithms for building Covering Arrays: A review Jimena Adriana Timaná-Peña Carlos Alberto Cobos-Lozada Jose Torres-Jimenez Ingeniería tabu search metaheuristics Covering Array simulated annealing genetic algorithms 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 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. 2016 artículo científico 0121-1129 https://www.redalyc.org/articulo.oa?id=413948045003 https://www.redalyc.org/journal/4139/413948045003/ https://www.redalyc.org/journal/4139/413948045003/html/ https://www.redalyc.org/journal/4139/413948045003/413948045003.epub https://www.redalyc.org/journal/4139/413948045003/movil en http://www.redalyc.org/revista.oa?id=4139 Facultad de Ingeniería application/pdf Universidad Pedagógica y Tecnológica de Colombia Facultad de Ingeniería (Colombia) Num.43 Vol.25 |
| title | Metaheuristic algorithms for building Covering Arrays: A review |
| topic | Ingeniería tabu search metaheuristics Covering Array simulated annealing genetic algorithms |
| url | https://www.redalyc.org/articulo.oa?id=413948045003 https://www.redalyc.org/journal/4139/413948045003/ https://www.redalyc.org/journal/4139/413948045003/html/ https://www.redalyc.org/journal/4139/413948045003/413948045003.epub https://www.redalyc.org/journal/4139/413948045003/movil |