2000 character limit reached
Dynamic Solution Probability Acceptance within the Flower Pollination Algorithm for t-way Test Suite Generation (1902.11160v1)
Published 13 Feb 2019 in cs.SE
Abstract: Flower Pollination Algorithm (FPA) is the new breed of metaheuristic for the general optimization problem. In this paper, an improved algorithm based on Flower Pollination Algorithm (FPA), called imFPA, has been proposed. In imFPA, the static selection probability is replaced by the dynamic solution selection probability in order to enhance the diversification and intensification 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.