Abstract
This paper presents a simulated annealing (SA) algorithm for the construction of ternary covering arrays (CAs) using a trinomial coefficient representation. A ternary CA, denoted by CA(t,k,3), is an N ×k array where each N ×t subarray contains each of the 3t combinations of symbols at least once. The construction of optimal CAs is, in general, an NP-complete problem. Many reported SA implementations use an N ×k matrix representation for the CA construction. Instead of this, we represent ternary CAs using trinomial coefficients in order to reduce the search space for the SA algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hartman, A.: Software and hardware testing using combinatorial covering suites. In: Graph Theory, Combinatorics and Algorithms. Operations Research/Computer Science Interfaces Series, vol. 34, pp. 237–266. Springer US, Heidelberg (2005)
Sloane, N.: Covering arrays and intersecting codes. Journal of Combinatorial Designs 1, 51–63 (1993)
Ji, L., Yin, J.: Constructions of new orthogonal arrays and covering arrays of strength three. J. Comb. Theory, Ser. A 117, 236–247 (2010)
Bush, K.: Orthogonal arrays of index unity. Annals of Mathematical Statistics 23(3), 426–434 (1952)
Lei, Y., Tai, K.C.: In-parameter-order: A test generation strategy for pairwise testing. In: HASE, pp. 254–261 (1998)
Stardom, J.: Metaheuristics and the search for covering and packing arrays. Master’s thesis, Simon Fraser University (2001)
Colbourn, C., Dinitz, J.: The CRC Handbook of Combinatorial Designs. CRC press, Boca Raton (1996)
Nurmela, K.J., Östergård, P.R.J.: Constructing covering designs by simulated annealing. Technical Report B10, Helsinki University of Technology, Digital Systems Labora tory, Espoo, Finland (1993)
Nurmela, K.J.: Upper bounds for covering arrays by tabu search. Discrete Appl. Math. 138, 143–152 (2004)
Martirosyan, S., van Trung, T.: On t-covering arrays. Des. Codes Cryptography 32, 323–339 (2004)
Hartman, A., Raskin, L.: Problems and algorithms for covering arrays. Discrete Mathematics 284, 149–156 (2004)
Forbes, M., Lawrence, J., Lei, Y., Kacker, R.N., Kuhn, D.R.: Refining the in-parameter-order strategy for constructing covering arrays. Journal of Research of the National Institute of Standards and Technology 213, 287–297 (2008)
Keeney, R.: On the trinomial coefficients. Mathematics Magazine 42, 210–212 (1969)
Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley Longman Publishing Co., Inc., Boston (1994)
Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martinez-Pena, J., Torres-Jimenez, J., Rangel-Valdez, N., Avila-George, H. (2010). A Heuristic Approach for Constructing Ternary Covering Arrays Using Trinomial Coefficients. In: Kuri-Morales, A., Simari, G.R. (eds) Advances in Artificial Intelligence – IBERAMIA 2010. IBERAMIA 2010. Lecture Notes in Computer Science(), vol 6433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16952-6_58
Download citation
DOI: https://doi.org/10.1007/978-3-642-16952-6_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16951-9
Online ISBN: 978-3-642-16952-6
eBook Packages: Computer ScienceComputer Science (R0)