A Simulated Annealing with Variable Neighborhood Search Approach to Construct Mixed Covering Arrays

Abstract Nowadays, the software use has been extended along almost all human activity areas and along with it, the reliability of software has become a need. Software testing consumes a significant portion of the cost of development of a new piece of software, and it is a stage that it is not feasible to ignore. A basic way to test a software is by doing an exhaustive testing process, but sometimes in the real world it is not feasible due to time and resource constraints. An alternative approach is called software interaction testing which is based on combinatorial structures called Covering Arrays and Mixed Covering Arrays (MCA) that are used to represent test-suites. This paper focuses on constructing MCAs by using a hybrid approach based on Simulated Annealing and a Variable Neighborhood Search function (SA-VNS). The quality of the solutions found was measured by solving a benchmark reported in the literature, and a comparison against other approaches shows that our proposed approach is an attractive and competitive option to construct MCAs.

[1]  Myra B. Cohen,et al.  A variable strength interaction testing of components , 2003, Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003.

[2]  José Torres-Jiménez,et al.  MiTS: A New Approach of Tabu Search for Constructing Mixed Covering Arrays , 2010, MICAI.

[3]  José Torres-Jiménez,et al.  Simulated Annealing for Constructing Mixed Covering Arrays , 2012, DCAI.

[4]  José Torres-Jiménez,et al.  Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach , 2010, COCOA.

[5]  José Torres-Jiménez,et al.  An improved simulated annealing algorithm for bandwidth minimization , 2008, Eur. J. Oper. Res..

[6]  José Torres-Jiménez,et al.  An Exact Approach to Maximize the Number of Wild Cards in a Covering Array , 2011, MICAI.

[7]  Pierre Hansen,et al.  Les Cahiers Du Gerad Variable Neighborhood Search Methods , 1999 .

[8]  José Torres-Jiménez,et al.  A Mutation-Selection Algorithm for the Problem of Minimum Brauer Chains , 2011, MICAI.

[9]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[10]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[11]  Yu Lei,et al.  Refining the In-Parameter-Order Strategy for Constructing Covering Arrays , 2008, Journal of research of the National Institute of Standards and Technology.

[12]  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).

[13]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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