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...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
Springer Singapore
2019
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/26245/2/1.1%20Dynamic%20solution%20probability%20acceptance%20within%20the%20flower.pdf |
| _version_ | 1796993623113334784 |
|---|---|
| author | Abdullah, Nasser Kamal Z., Zamli B. S., Ahmed |
| author_facet | Abdullah, Nasser Kamal Z., Zamli B. S., Ahmed |
| author_sort | Abdullah, Nasser |
| collection | UMP |
| 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. |
| first_indexed | 2024-03-06T12:36:38Z |
| format | Conference or Workshop Item |
| id | UMPir26245 |
| institution | Universiti Malaysia Pahang |
| language | English |
| last_indexed | 2024-03-06T12:36:38Z |
| publishDate | 2019 |
| publisher | Springer Singapore |
| record_format | dspace |
| spelling | UMPir262452020-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 |
| 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 |
| title | 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_short | 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 |
| topic | QA76 Computer software |
| url | http://umpir.ump.edu.my/id/eprint/26245/2/1.1%20Dynamic%20solution%20probability%20acceptance%20within%20the%20flower.pdf |
| work_keys_str_mv | AT abdullahnasser dynamicsolutionprobabilityacceptancewithintheflowerpollinationalgorithmforcombinatorialtwaytestsuitegeneration AT kamalzzamli dynamicsolutionprobabilityacceptancewithintheflowerpollinationalgorithmforcombinatorialtwaytestsuitegeneration AT bsahmed dynamicsolutionprobabilityacceptancewithintheflowerpollinationalgorithmforcombinatorialtwaytestsuitegeneration |