Abstract
This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distinguished features including an efficient heuristic to generate a good quality initial population, and a local search operator based on a fine tuned Simulated Annealing (SA) algorithm employing a carefully designed compound neighborhood. Its performance is investigated through extensive experimentation over well known benchmarks and compared with other state-of-the-art algorithms, showing improvements on some previous best-known results.
This research work was partially funded by the following projects: CONACyT 58554, Cálculo de Covering Arrays; CONACyT 99276, Algoritmos para la Canonización de Covering Arrays; 51623 Fondo Mixto CONACyT y Gobierno del Estado de Tamaulipas.
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
Preview
Unable to display preview. Download preview PDF.
References
Sloane, N.J.A.: Covering arrays and intersecting codes. Journal of Combinatorial Designs 1(1), 51–63 (1993)
Bush, K.A.: Orthogonal arrays of index unity. Annals of Mathematical Statistics 23(3), 426–434 (1952)
Seroussi, G., Bshouty, N.: Vector sets for exhaustive testing of logic circuits. IEEE Transactions on Information Theory 34, 513–522 (1988)
Lei, Y., Tai, K.: In-parameter-order: A test generation strategy for pairwise testing. In: 3rd IEEE International Symposium on High-Assurance Systems Engineering, pp. 254–261. IEEE Press, Washington (1998)
Chateauneuf, M.A., Kreher, D.L.: On the state of strength-three covering arrays. Journal of Combinatorial Design 10(4), 217–238 (2002)
Hartman, A., Raskin, L.: Problems and algorithms for covering arrays. Discrete Mathematics 284(1-3), 149–156 (2004)
Hedayat, A.S., Sloane, N.J.A., Stufken, J.: Orthogonal Arrays, Theory and Applications. Springer, Berlin (1999)
Cohen, D.M., Dalal, S.R., Fredman, M.L., Patton, G.C.: The AETG system: An approach to testing based on combinatorial design. IEEE Transactions on Software Engineering 23, 437–444 (1997)
Nurmela, K.J.: Upper bounds for covering arrays by tabu search. Discrete Applied Mathematics 138(1-2), 143–152 (2004)
Cohen, D.M., Colbourn, C.J., Ling, A.C.H.: Constructing strength three covering arrays with augmented annealing. Discrete Mathematics 308(13), 2709–2722 (2008)
Stardom, J.: Metaheuristics and the search for covering and packing arrays. Master’s thesis, Simon Fraser University, Burnaby, Canada (2001)
Roux, G.: k-propriétés dans des tableaux de n colonnes; cas particulier de la k-surjectivité et de la k-permutivité. PhD thesis, Université de Paris 6, France (1987)
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 113(5), 287–297 (2008)
Lei, Y., Kacker, R., Kuhn, D.R., Okun, V., Lawrence, J.: IPOG: A general strategy for t-way software. In: 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems, pp. 549–556. IEEE Press, Washington (2007)
Nurmela, K.J., Östergård, P.R.J.: Constructing covering designs by simulated annealing. Technical Report 10, Department of Computer Science, Helsinki University of Technology, Otaniemi, Finland (January 1993)
Mladenović, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research 24(11), 1097–1100 (1997)
Urosević, D., Brimberg, J., Mladenović, N.: Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem. Computers & Operations Research 31(8), 1205–1213 (2004)
Rodriguez-Tello, E., Hao, J.K., Torres-Jimenez, J.: An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem. Computers & Operations Research 35(10), 3331–3346 (2008)
Rodriguez-Tello, E., Hao, J.-K., Torres-Jiménez, J.: Memetic algorithms for the minLA problem. In: Talbi, E.-G., Liardet, P., Collet, P., Lutton, E., Schoenauer, M. (eds.) EA 2005. LNCS, vol. 3871, pp. 73–84. Springer, Heidelberg (2006)
Colbourn, C.J.: Covering Array Tables (2009), http://www.public.asu.edu/~ccolbou/src/tabby/catable.html (accessed March 17, 2009)
Martirosyan, S.S., Van Trung, T.: On t-covering arrays. Designs, Codes and Cryptography 32(1-3), 323–339 (2004)
Hartman, A.: Software and hardware testing using combinatorial covering suites. In: Graph Theory, Combinatorics and Algorithms, pp. 237–266. Springer, Heidelberg (2005)
Krasnogor, N.: Towards robust memetic algorithms. In: Recent Advances in Memetic Algorithms, pp. 185–207. Springer, Heidelberg (2004)
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
Rodriguez-Tello, E., Torres-Jimenez, J. (2010). Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three. In: Collet, P., Monmarché, N., Legrand, P., Schoenauer, M., Lutton, E. (eds) Artifical Evolution. EA 2009. Lecture Notes in Computer Science, vol 5975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14156-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-14156-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14155-3
Online ISBN: 978-3-642-14156-0
eBook Packages: Computer ScienceComputer Science (R0)