Abstract
The construction of covering arrays, the combinatorial structures underlying combinatorial test suites, is a highly researched topic. In previous works, various metaheuristic algorithms, such as Simulated Annealing and Tabu Search, were used to successfully construct covering arrays with a small number of rows. In this paper, we propose for the first time a quantum-inspired evolutionary algorithm for covering array generation. For this purpose, we introduce a simpler and more natural qubit representation as well as new rotation and mutation operators. We implemented different versions of our algorithm employing the different operators. We evaluate the different implementations against selected (optimal) covering array instances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In the literature t-way interactions are defined for arbitrary alphabets. However we restrict our attention to binary t-way interactions.
References
Cleve, R., Ekert, A., Macchiavello, C., Mosca, M.: Quantum algorithms revisited. In: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 454, August 1997
Colbourn, C.J.: Covering Array Tables for t = 2, 3, 4, 5, 6. http://www.public.asu.edu/~ccolbou/src/tabby/catable.html. Accessed 26 Feb 2019
Colbourn, C.J.: Combinatorial aspects of covering arrays. Le Mathematiche LIX((I–II)), 125–172 (2004)
Danziger, P., Mendelsohn, E., Moura, L., Stevens, B.: Covering arrays avoiding forbidden edges. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol. 5165, pp. 296–308. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-85097-7_28
Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC 1996, pp. 212–219. ACM, New York (1996)
Han, K.H., Kim, J.H.: Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans. Evol. Comput. 6(6), 580–593 (2002)
Han, K.H., Kim, J.H.: Quantum-inspired evolutionary algorithms with a new termination criterion, h/sub /spl epsi// gate, and two-phase scheme. IEEE Trans. Evol. Comput. 8(2), 156–169 (2004)
Han, K.H., Kim, J.H.: On the analysis of the quantum-inspired evolutionary algorithm with a single individual. In: 2006 IEEE International Conference on Evolutionary Computation, pp. 2622–2629, July 2006
Hnich, B., Prestwich, S.D., Selensky, E., Smith, B.M.: Constraint models for the covering test problem. Constraints 11(2), 199–219 (2006)
Kampel, L., Simos, D.E.: A survey on the state of the art of complexity problems for covering arrays. Theor. Comput. Sci. (2019). https://doi.org/10.1016/j.tcs.2019.10.019
Kleine, K., Simos, D.E.: An efficient design and implementation of the in-parameter-order algorithm. Math. Comput. Sci. 12(1), 51–67 (2018)
Kuhn, D., Kacker, R., Lei, Y.: Introduction to Combinatorial Testing. Chapman & Hall/CRC Innovations in Software Engineering and Software Development Series. Taylor & Francis, Routledge (2013)
Lei, Y., Tai, K.C.: In-parameter-order: a test generation strategy for pairwise testing. In: Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No. 98EX231), pp. 254–261, November 1998
Martí, R., Pardalos, P., Resende, M.: Handbook of Heuristics. Springer, Heidelberg (2018)
Nayeri, P., Colbourn, C.J., Konjevod, G.: Randomized post-optimization of covering arrays. Eur. J. Comb. 34(1), 91–103 (2013)
Nielsen, M.A., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, New York (2002)
Seroussi, G., Bshouty, N.H.: Vector sets for exhaustive testing of logic circuits. IEEE Trans. Inf. Theory 34(3), 513–522 (1988)
Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124–134, November 1994
Torres-Jimenez, J., Izquierdo-Marquez, I.: Survey of covering arrays. In: 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 20–27, September 2013
Torres-Jimenez, J., Rodriguez-Tello, E.: New bounds for binary covering arrays using simulated annealing. Inf. Sci. 185(1), 137–152 (2012)
Yanofsky, N.S., Mannucci, M.A., Mannucci, M.A.: Quantum Computing for Computer Scientists, vol. 20. Cambridge University Press, Cambridge (2008)
Zhang, G.: Quantum-inspired evolutionary algorithms: a survey and empirical study. J. Heuristics 17(3), 303–351 (2011)
Acknowledgements
This research was carried out partly in the context of the Austrian COMET K1 program and publicly funded by the Austrian Research Promotion Agency (FFG) and the Vienna Business Agency (WAW).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Wagner, M., Kampel, L., Simos, D.E. (2019). Quantum-Inspired Evolutionary Algorithms for Covering Arrays of Arbitrary Strength. In: Kotsireas, I., Pardalos, P., Parsopoulos, K., Souravlias, D., Tsokas, A. (eds) Analysis of Experimental Algorithms. SEA 2019. Lecture Notes in Computer Science(), vol 11544. Springer, Cham. https://doi.org/10.1007/978-3-030-34029-2_20
Download citation
DOI: https://doi.org/10.1007/978-3-030-34029-2_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-34028-5
Online ISBN: 978-3-030-34029-2
eBook Packages: Computer ScienceComputer Science (R0)