UMP Institutional Repository

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

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

[img]
Preview
Pdf
1.1 Dynamic solution probability acceptance within the flower.pdf

Download (104kB) | Preview

Abstract

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.

Item Type: Conference or Workshop Item (Lecture)
Additional Information: Indexed by WOS; Lecture Notes in Networks and Systems
Uncontrolled Keywords: Search-Based Software Engineering; Meta-Heuristic; Flower Pollination Algorithm; T-Way Testing; Test Suite Generation
Subjects: Q Science > QA Mathematics > QA76 Computer software
Faculty/Division: Faculty of Computer System And Software Engineering
Depositing User: Pn. Hazlinda Abd Rahman
Date Deposited: 20 Dec 2019 08:55
Last Modified: 23 Jan 2020 02:32
URI: http://umpir.ump.edu.my/id/eprint/26245
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item