Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • apa.csl
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Hybrid flower pollination algorithm strategies for t-way test suite generation
University Malaysia Pahang, MYS.ORCID iD: 0000-0002-5377-999X
University Malaysia Pahang, MYS.ORCID iD: 0000-0003-4626-0513
University Malaysia Pahang, MYS.
Czech Technical University, CZE.ORCID iD: 0000-0001-9051-7609
2018 (English)In: PLOS ONE, E-ISSN 1932-6203, Vol. 13, no 5, article id e0195187Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
Public library science , 2018. Vol. 13, no 5, article id e0195187
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-86834DOI: 10.1371/journal.pone.0195187ISI: 000431281900014PubMedID: 29718918OAI: oai:DiVA.org:kau-86834DiVA, id: diva2:1608350
Available from: 2021-11-03 Created: 2021-11-03 Last updated: 2021-11-04Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textPubMed

Authority records

Ahmed, Bestoun S.

Search in DiVA

By author/editor
Nasser, Abdullah B.Zamli, Kamal Z.Ahmed, Bestoun S.
In the same journal
PLOS ONE
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
pubmed
urn-nbn

Altmetric score

doi
pubmed
urn-nbn
Total: 183 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • apa.csl
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf