Dynamic solution probability acceptance within the flower pollination algorithm for combinatorial t-way test suite generation

Dynamic solution probability acceptance within the flower pollination algorithm for combinatorial t-way test suite generation

In this paper, the enhanced Flower PollinationAlgorithm (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...

Full description

Bibliographic Details
Main Authors: Abdullah, Nasser, Kamal Z., Zamli, B. S., Ahmed
Format: Conference or Workshop Item
Language:English
Published: Springer Singapore 2019
Subjects:
QA76 Computer software
Online Access:http://umpir.ump.edu.my/id/eprint/26245/
http://umpir.ump.edu.my/id/eprint/26245/
http://umpir.ump.edu.my/id/eprint/26245/2/1.1%20Dynamic%20solution%20probability%20acceptance%20within%20the%20flower.pdf
id ump-26245
recordtype eprints
spelling ump-262452020-01-23T02:32:32Z http://umpir.ump.edu.my/id/eprint/26245/ Dynamic solution probability acceptance within the flower pollination algorithm for combinatorial t-way test suite generation Abdullah, Nasser Kamal Z., Zamli B. S., Ahmed QA76 Computer software In this paper, the enhanced Flower PollinationAlgorithm (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 Singapore 2019 Conference or Workshop Item PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/26245/2/1.1%20Dynamic%20solution%20probability%20acceptance%20within%20the%20flower.pdf Abdullah, Nasser and Kamal Z., Zamli and B. S., Ahmed (2019) Dynamic solution probability acceptance within the flower pollination algorithm for combinatorial t-way test suite generation. In: Intelligent and Interactive Computing: Proceedings of IIC 2018, 8-9 August 2018 , Universiti Teknikal Malaysia Melaka (UTeM). pp. 3-11., 67. ISBN 978-981-13-6030-5 https://doi.org/10.1007/978-981-13-6031-2_4
repository_type Digital Repository
institution_category Local University
institution Universiti Malaysia Pahang
building UMP Institutional Repository
collection Online Access
language English
topic QA76 Computer software
spellingShingle QA76 Computer software
Abdullah, Nasser
Kamal Z., Zamli
B. S., Ahmed
Dynamic solution probability acceptance within the flower pollination algorithm for combinatorial t-way test suite generation
description In this paper, the enhanced Flower PollinationAlgorithm (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.
format Conference or Workshop Item
author Abdullah, Nasser
Kamal Z., Zamli
B. S., Ahmed
author_facet Abdullah, Nasser
Kamal Z., Zamli
B. S., Ahmed
author_sort Abdullah, Nasser
title Dynamic solution probability acceptance within the flower pollination algorithm for combinatorial t-way test suite generation
title_short Dynamic solution probability acceptance within the flower pollination algorithm for combinatorial t-way test suite generation
title_full Dynamic solution probability acceptance within the flower pollination algorithm for combinatorial t-way test suite generation
title_fullStr Dynamic solution probability acceptance within the flower pollination algorithm for combinatorial t-way test suite generation
title_full_unstemmed Dynamic solution probability acceptance within the flower pollination algorithm for combinatorial t-way test suite generation
title_sort dynamic solution probability acceptance within the flower pollination algorithm for combinatorial t-way test suite generation
publisher Springer Singapore
publishDate 2019
url http://umpir.ump.edu.my/id/eprint/26245/
http://umpir.ump.edu.my/id/eprint/26245/
http://umpir.ump.edu.my/id/eprint/26245/2/1.1%20Dynamic%20solution%20probability%20acceptance%20within%20the%20flower.pdf
first_indexed 2023-09-18T22:40:45Z
last_indexed 2023-09-18T22:40:45Z
_version_ 1777416898665775104

Similar Items