SciELO - Scientific Electronic Library Online

 
vol.25 issue43Production of building elements based on alkali-activated red clay brick wasteElectrolytic process applied with addition of salts for color removal in drinking water treatment author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Article

Indicators

Related links

  • On index processCited by Google
  • Have no similar articlesSimilars in SciELO
  • On index processSimilars in Google

Share


Revista Facultad de Ingeniería

Print version ISSN 0121-1129

Abstract

TIMANA-PENA, Jimena Adriana; COBOS-LOZADA, Carlos Alberto  and  TORRES-JIMENEZ, Jose. Metaheuristic algorithms for building Covering Arrays: A review. Rev. Fac. ing. [online]. 2016, vol.25, n.43, pp.31-45. ISSN 0121-1129.

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.

Keywords : ant colony optimization; Covering Array; genetic algorithms; harmony search algorithm; metaheuristics; particle swarm optimization; simulated annealing; tabu search.

        · abstract in Spanish | Portuguese     · text in English     · English ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License