Application of heuristic methods for conformance test selection

Abstract In this paper we focus on the test selection problem. It is modeled after a real-life problem that arises in telecommunication when one has to check the reliability of an application. We apply different metaheuristics, namely Reactive Tabu Search (RTS), Genetic Algorithms (GA) and Simulated Annealing (SA) to solve the problem. We propose some modifications to the conventional schemes including an adaptive neighbourhood sampling in RTS, an adaptive variable mutation rate in GA and an adaptive variable neighbourhood structure in SA. The performance of the algorithms is evaluated in different models for existing protocols. Computational results show that GA and SA can provide high-quality solutions in acceptable time compared to the results of a commercial software, which makes them applicable in practical test selection.

[1]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

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

[3]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[4]  Balázs Kotnyek,et al.  Test Suite Reduction in Conformance Testing , 1999, Acta Cybern..

[5]  M. Pirlot.  General local search methods , 1996 .

[6]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[7]  K. Al-Sultan,et al.  A Genetic Algorithm for the Set Covering Problem , 1996 .

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Balázs Kotnyek,et al.  Automated Test Case Selection Based on Subpurposes , 1999, IWTCS.

[10]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[11]  Victor J. Rayward-Smith,et al.  Modern Heuristic Search Methods , 1996 .

[12]  S. Dreyfus,et al.  Thermodynamical Approach to the Traveling Salesman Problem : An Efficient Simulation Algorithm , 2004 .

[13]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[14]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[15]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[16]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[17]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[18]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[19]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[20]  Krishan K. Sabnani,et al.  Algorithmic generation of protocol conformance tests , 1990, AT&T Technical Journal.