作者: Abdullah B. Nasser , Kamal Z. Zamli , Bestoun S. Ahmed
DOI: 10.1007/978-981-13-6031-2_4
关键词: Meta heuristic 、 Computer science 、 Search-based software engineering 、 Interaction strength 、 Test suite 、 Algorithm 、 Selection (genetic algorithm) 、 Pollination 、 Process (computing)
摘要: In this paper, the enhanced Flower Pollination Algorithm (FPA) algorithm, called imFPA, has been proposed. Within static selection probability is replaced by dynamic solution in order to enhance intensification and diversification of overall search process. Experimental adoptions on combinatorial t-way test suite generation problem (where t indicates interaction strength) show that imFPA produces very competitive results as compared existing strategies.