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
Dynamic solution probability acceptance within the flower pollination algorithm for combinatorial t-way test suite generation
Universiti Malaysia Pahang, MYS.
Universiti Malaysia Pahang, MYS.
Czech Technical University, CZE.ORCID iD: 0000-0001-9051-7609
2019 (English)In: Intelligent and Interactive Computing / [ed] V Piuri ; V Balas; S Borah ; S Syed Ahmad, Springer , 2019, p. 3-11Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, the enhanced Flower Pollination Algorithm (FPA) algorithm, called imFPA, has been proposed. Within imFPA, the static selection probability is replaced by the dynamic solution selection probability in order to enhance the intensification and diversification of the overall search process. Experimental adoptions on combinatorial t-way test suite generation problem (where t indicates the interaction strength) show that imFPA produces very competitive results as compared to existing strategies. © Springer Nature Singapore Pte Ltd. 2019.

Place, publisher, year, edition, pages
Springer , 2019. p. 3-11
Series
Lecture Notes in Networks and Systems, ISSN 2367-3370, E-ISSN 2367-3389 ; 67
Keywords [en]
Flower pollination algorithm, Meta-heuristic, Search-based software engineering, t-way testing, Test suite generation
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kau:diva-86825DOI: 10.1007/978-981-13-6031-2_4Scopus ID: 2-s2.0-85066124124OAI: oai:DiVA.org:kau-86825DiVA, id: diva2:1608272
Conference
Intelligent and Interactive Computing
Available from: 2021-11-03 Created: 2021-11-03 Last updated: 2021-11-17Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Ahmed, Bestoun S.

Search in DiVA

By author/editor
Ahmed, Bestoun S.
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 91 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