Combinatorial testing data generation based on bird swarm algorithm

Combinatorial test data generation is a research hotspot in combination testing. Evolutionary algorithm has been applied successfully into generating covering arrays that are competitive in size. In this paper, Bird Swarm Algorithm (BSA) is introduced to explore the effect of covering array generation. However, no suitable parameter configurations are available to guide BSA to search solutions. In order to determine the optimal configuration of BSA for this problem, parameter tuning makes an operation on it. Moreover, this paper also does three improvements containing the Levy flight, the bird reinitialization strategy, and the dynamic flight frequency on the original BSA to boost its ability to jump out of the local optimal. Experimental results present that BSA for combinatorial test data generation becomes an effective method and that Enhanced Bird Swarm Algorithm (EBSA) can produce smaller covering arrays than the original BSA.

[1]  José Torres-Jiménez,et al.  Simulated Annealing for constructing binary covering arrays of variable strength , 2010, IEEE Congress on Evolutionary Computation.

[2]  Alan Hartman,et al.  Problems and algorithms for covering arrays , 2004, Discret. Math..

[3]  Changhai Nie,et al.  A Discrete Particle Swarm Optimization for Covering Array Generation , 2015, IEEE Transactions on Evolutionary Computation.

[4]  M. J. Reilly,et al.  An investigation of the applicability of design of experiments to software testing , 2002, 27th Annual NASA Goddard/IEEE Software Engineering Workshop, 2002. Proceedings..

[5]  Kamal Z. Zamli,et al.  PSTG: A T-Way Strategy Adopting Particle Swarm Optimization , 2010, 2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation.

[6]  Yu Lei,et al.  In-parameter-order: a test generation strategy for pairwise testing , 1998, Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No.98EX231).

[7]  Michael L. Fredman,et al.  The AETG System: An Approach to Testing Based on Combinatiorial Design , 1997, IEEE Trans. Software Eng..

[8]  Xiang Chen,et al.  Variable Strength Interaction Testing with an Ant Colony System Approach , 2009, 2009 16th Asia-Pacific Software Engineering Conference.

[9]  Myra B. Cohen,et al.  Constructing test suites for interaction testing , 2003, 25th International Conference on Software Engineering, 2003. Proceedings..

[10]  Robert L. Probert,et al.  A practical strategy for testing pair-wise coverage of network interfaces , 1996, Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering.

[11]  Myra B. Cohen,et al.  Evaluating improvements to a meta-heuristic search for constrained interaction testing , 2011, Empirical Software Engineering.

[12]  Myra B. Cohen,et al.  Constructing strength three covering arrays with augmented annealing , 2003, Discret. Math..

[13]  Charles J. Colbourn,et al.  Tabu search for covering arrays using permutation vectors , 2009 .

[14]  K. A. Bush.  Orthogonal Arrays of Index Unity , 1952 .

[15]  Kari J. Nurmela,et al.  Upper bounds for covering arrays by tabu search , 2004, Discret. Appl. Math..

[16]  Siddhartha R. Dalal,et al.  The Automatic Efficient Test Generator (AETG) system , 1994, Proceedings of 1994 IEEE International Symposium on Software Reliability Engineering.

[17]  Robert Mandl,et al.  Orthogonal Latin squares: an application of experiment design to compiler testing , 1985, CACM.

[18]  Kamal Zuhairi Zamli,et al.  A variable strength interaction test suites generation strategy using Particle Swarm Optimization , 2011, J. Syst. Softw..

[19]  Jeff Yu Lei,et al.  IPOG: A General Strategy for T-Way Software Testing , 2007, 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS'07).

[20]  Xiang Chen,et al.  Applying Particle Swarm Optimization to Pairwise Testing , 2010, 2010 IEEE 34th Annual Computer Software and Applications Conference.

[21]  Moataz A. Ahmed,et al.  Pair-wise test coverage using genetic algorithms , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[22]  Tatsuhiro Tsuchiya,et al.  Using artificial life techniques to generate test cases for combinatorial testing , 2004, Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004..

[23]  Jeff Yu Lei,et al.  IPOG/IPOG‐D: efficient test generation for multi‐way combinatorial testing , 2008, Softw. Test. Verification Reliab..

[24]  Kamal Z. Zamli,et al.  Design and implementation of a harmony-search-based variable-strength t-way testing strategy with constraints support , 2012, Inf. Softw. Technol..

[25]  Jian Zhang,et al.  Combinatorial Testing: Principles and Methods: Combinatorial Testing: Principles and Methods , 2009 .

[26]  José Torres-Jiménez,et al.  A two-stage algorithm for combinatorial testing , 2017, Optim. Lett..

[27]  Myra B. Cohen,et al.  Designing Test Suites for Software Interactions Testing , 2004 .

[28]  Yu Liu,et al.  A new bio-inspired optimisation algorithm: Bird Swarm Algorithm , 2016, J. Exp. Theor. Artif. Intell..

[29]  José Torres-Jiménez,et al.  New bounds for binary covering arrays using simulated annealing , 2012, Inf. Sci..