Dynamic Solution Probability Acceptance Within the Flower Pollination Algorithm for Combinatorial t-Way Test Suite Generation

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F19%3A00334981" target="_blank" >RIV/68407700:21230/19:00334981 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-981-13-6031-2_4" target="_blank" >http://dx.doi.org/10.1007/978-981-13-6031-2_4</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-981-13-6031-2_4" target="_blank" >10.1007/978-981-13-6031-2_4</a>

Result language
angličtina
Original language name
Dynamic Solution Probability Acceptance Within the Flower Pollination Algorithm for Combinatorial t-Way Test Suite Generation
Original language description
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.
Czech name
—
Czech description
—

Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/TH02010296" target="_blank" >TH02010296: Quality Assurance System for Internet of Things Technology</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)