Hybrid flower pollination algorithm strategies for t-way test suite generation
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00322729" target="_blank" >RIV/68407700:21230/18:00322729 - isvavai.cz</a>
Výsledek na webu
<a href="https://journals.plos.org/plosone/article/citation?id=10.1371/journal.pone.0195187" target="_blank" >https://journals.plos.org/plosone/article/citation?id=10.1371/journal.pone.0195187</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1371/journal.pone.0195187" target="_blank" >10.1371/journal.pone.0195187</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Hybrid flower pollination algorithm strategies for t-way test suite generation
Popis výsledku v původním jazyce
The application of meta-heuristic algorithms for t-way testing has recently become prevalent. Consequently, many useful meta-heuristic algorithms have been developed on the basis of the implementation of t-way strategies (where t indicates the interaction strength). Mixed results have been reported in the literature to highlight the fact that no single strategy appears to be superior compared with other configurations. The hybridization of two or more algorithms can enhance the overall search capabilities, that is, by compensating the limitation of one algorithm with the strength of others. Thus, hybrid variants of the flower pollination algorithm (FPA) are proposed in the current work. Four hybrid variants of FPA are considered by combining FPA with other algorithmic components. The experimental results demonstrate that FPA hybrids overcome the problems of slow convergence in the original FPA and offers statistically superior performance compared with existing t-way strategies in terms of test suite size.
Název v anglickém jazyce
Hybrid flower pollination algorithm strategies for t-way test suite generation
Popis výsledku anglicky
The application of meta-heuristic algorithms for t-way testing has recently become prevalent. Consequently, many useful meta-heuristic algorithms have been developed on the basis of the implementation of t-way strategies (where t indicates the interaction strength). Mixed results have been reported in the literature to highlight the fact that no single strategy appears to be superior compared with other configurations. The hybridization of two or more algorithms can enhance the overall search capabilities, that is, by compensating the limitation of one algorithm with the strength of others. Thus, hybrid variants of the flower pollination algorithm (FPA) are proposed in the current work. Four hybrid variants of FPA are considered by combining FPA with other algorithmic components. The experimental results demonstrate that FPA hybrids overcome the problems of slow convergence in the original FPA and offers statistically superior performance compared with existing t-way strategies in terms of test suite size.
Klasifikace
Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Návaznosti výsledku
Projekt
—
Návaznosti
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Ostatní
Rok uplatnění
2018
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název periodika
PLoS ONE
ISSN
1932-6203
e-ISSN
1932-6203
Svazek periodika
13
Číslo periodika v rámci svazku
5
Stát vydavatele periodika
US - Spojené státy americké
Počet stran výsledku
24
Strana od-do
—
Kód UT WoS článku
000431281900014
EID výsledku v databázi Scopus
2-s2.0-85046494540