• Je něco špatně v tomto záznamu ?

Hybrid flower pollination algorithm strategies for t-way test suite generation

AB. Nasser, KZ. Zamli, AA. Alsewari, BS. Ahmed,

. 2018 ; 13 (5) : e0195187. [pub] 20180502

Jazyk angličtina Země Spojené státy americké

Typ dokumentu časopisecké články, práce podpořená grantem

Perzistentní odkaz   https://www.medvik.cz/link/bmc18033113

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.

Citace poskytuje Crossref.org

000      
00000naa a2200000 a 4500
001      
bmc18033113
003      
CZ-PrNML
005      
20181010125447.0
007      
ta
008      
181008s2018 xxu f 000 0|eng||
009      
AR
024    7_
$a 10.1371/journal.pone.0195187 $2 doi
035    __
$a (PubMed)29718918
040    __
$a ABA008 $b cze $d ABA008 $e AACR2
041    0_
$a eng
044    __
$a xxu
100    1_
$a Nasser, Abdullah B $u Faculty of Computer Systems and Software Engineering, Universiti Malaysia Pahang, Kuantan, Pahang, Malaysia.
245    10
$a Hybrid flower pollination algorithm strategies for t-way test suite generation / $c AB. Nasser, KZ. Zamli, AA. Alsewari, BS. Ahmed,
520    9_
$a 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.
650    12
$a algoritmy $7 D000465
650    _2
$a květy $x fyziologie $7 D035264
650    12
$a biologické modely $7 D008954
650    12
$a opylení $7 D054817
655    _2
$a časopisecké články $7 D016428
655    _2
$a práce podpořená grantem $7 D013485
700    1_
$a Zamli, Kamal Z $u Faculty of Computer Systems and Software Engineering, Universiti Malaysia Pahang, Kuantan, Pahang, Malaysia.
700    1_
$a Alsewari, AbdulRahman A $u Faculty of Computer Systems and Software Engineering, Universiti Malaysia Pahang, Kuantan, Pahang, Malaysia.
700    1_
$a Ahmed, Bestoun S $u Faculty of Electrical Engineering, Department of Computer Science, Czech Technical University, Praha 2, Czech Republic.
773    0_
$w MED00180950 $t PloS one $x 1932-6203 $g Roč. 13, č. 5 (2018), s. e0195187
856    41
$u https://pubmed.ncbi.nlm.nih.gov/29718918 $y Pubmed
910    __
$a ABA008 $b sig $c sign $y a $z 0
990    __
$a 20181008 $b ABA008
991    __
$a 20181010125936 $b ABA008
999    __
$a ok $b bmc $g 1340805 $s 1030107
BAS    __
$a 3
BAS    __
$a PreBMC
BMC    __
$a 2018 $b 13 $c 5 $d e0195187 $e 20180502 $i 1932-6203 $m PLoS One $n PLoS One $x MED00180950
LZP    __
$a Pubmed-20181008

Najít záznam

Citační ukazatele

Možnosti archivace