Dynamic Solution Probability Acceptance within the Flower Pollination Algorithm for t-way Test Suite Generation.
作者： Bestoun S. Ahmed , Abdullah B. Nasser , Kamal Z. Zamli
DOI:
关键词: Selection (genetic algorithm) 、 Pollination 、 Algorithm 、 Breed 、 Metaheuristic 、 Optimization problem 、 Test suite 、 Process (computing) 、 Computer science
摘要: Flower Pollination Algorithm (FPA) is the new breed of metaheuristic for general optimization problem. In this paper, an improved algorithm based on (FPA), called imFPA, has been proposed. static selection probability replaced by dynamic solution in order to enhance diversification and intensification overall search process. Experimental adoptions combinatorial t- way test suite generation problem (where t indicates interaction strength) show that imFPA produces very competitive results as compared existing strategies.
harvard.edu
arxiv.org参考文章(18)
Bestoun S. Ahmed, Taib Sh. Abdulsamad, Moayad Y. Potrus, Achievement of minimized combinatorial test suite for configuration-aware software functional testing using the Cuckoo Search algorithm Information & Software Technology. ,vol. 66, pp. 13- 29 ,(2015) , 10.1016/J.INFSOF.2015.05.005
Bestoun S Ahmed, Chee Peng Lim, Kamal Z Zamli, Constructing a t-way interaction test suite using the Particle Swarm Optimization approach International Journal of Innovative Computing Information and Control. ,vol. 8, pp. 431- 451 ,(2012)
Mark Harman, S. Afshin Mansouri, Yuanyuan Zhang, Search-based software engineering ACM Computing Surveys. ,vol. 45, pp. 1- 61 ,(2012) , 10.1145/2379776.2379787
J. Clarke, J.J. Dolado, M. Harman, R. Hierons, B. Jones, M. Lumkin, B. Mitchell, S. Mancoridis, K. Rees, M. Roper, M. Shepperd, Reformulating software engineering as a search problem IEE Proceedings - Software. ,vol. 150, pp. 161- 175 ,(2003) , 10.1049/IP-SEN:20030559
Zong Woo Geem, Optimal Design of Water Distribution Networks Using Harmony Search ,(2009)
D.R. Kuhn, D.R. Wallace, A.M. Gallo, Software fault interactions and implications for software testing IEEE Transactions on Software Engineering. ,vol. 30, pp. 418- 421 ,(2004) , 10.1109/TSE.2004.24
T. Kikuno, T. Tsuchiya, T. Shiba, Using artificial life techniques to generate test cases for combinatorial testing computer software and applications conference. ,vol. 2, pp. 72- 77 ,(2004) , 10.1109/CMPSAC.2004.1342808
Xiang Chen, Qing Gu, Jingxian Qi, Daoxu Chen, Applying Particle Swarm Optimization to Pairwise Testing computer software and applications conference. pp. 107- 116 ,(2010) , 10.1109/COMPSAC.2010.17
Abdul Rahman A. Alsewari, A harmony search based pairwise sampling strategy for combinatorial testing International Journal of Physical Sciences. ,vol. 7, pp. 1062- 1072 ,(2012) , 10.5897/IJPS11.1633
Kamal Z. Zamli, Basem Y. Alkazemi, Graham Kendall, A Tabu Search hyper-heuristic strategy for t-way test suite generation soft computing. ,vol. 44, pp. 57- 74 ,(2016) , 10.1016/J.ASOC.2016.03.021