Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2012, Article ID 897027, 19 pages
http://dx.doi.org/10.1155/2012/897027
Research Article

New Bounds for Ternary Covering Arrays Using a Parallel Simulated Annealing

1Instituto Tecnológico Superior de Salvatierra, Madero 303, 38900 Salvatierra, Guanajuato, Mexico
2Information Technology Laboratory, Cinvestav Tamaulipas, Km. 5.5 Carretera Victoria-Soto La Marina, 87130 Victoria, TAMPS, Mexico
3Instituto de Instrumentación para Imagen Molecular (I3M), Universitat Politècnica de València, Camino de Vera s/n, 46022 Valencia, Spain

Received 24 February 2012; Revised 15 June 2012; Accepted 7 July 2012

Academic Editor: John Gunnar Carlsson

Copyright © 2012 Himer Avila-George et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. M. Cohen, S. R. Dalal, J. Parelius, and G. C. Patton, “The combinatorial design approach to automatic test generation,” IEEE Software, vol. 13, no. 5, pp. 83–88, 1996. View at Google Scholar · View at Scopus
  2. K. Z. Zamli, M. F. J. Klaib, M. I. Younis, N. A. M. Isa, and R. Abdullah, “Design and implementation of a t-way test data generation strategy with automated execution tool support,” Information Sciences, vol. 181, no. 9, pp. 1741–1758, 2011. View at Publisher · View at Google Scholar · View at Scopus
  3. A. Hartman, “Software and hardware testing using combinatorial covering suites,” in Graph Theory, Combinatorics and Algorithms, M. C. Golumbic and I. B. A. Hartman, Eds., vol. 34 of Operations Research/Computer Science Interfaces, pp. 237–266, Springer, New York, NY, USA, 2005. View at Publisher · View at Google Scholar
  4. E. H. L. Aarts and P. J. M. van Laarhoven, “Statistical cooling: a general approach to combinatorial optimization problems,” Philips Journal of Research, vol. 40, no. 4, pp. 193–226, 1985. View at Google Scholar
  5. D. Janaki Ram, T. H. Sreenivas, and K. G. Subramaniam, “Parallel simulated annealing algorithms,” Journal of Parallel and Distributed Computing, vol. 37, no. 2, pp. 207–212, 1996. View at Publisher · View at Google Scholar · View at Scopus
  6. S. Y. Lee and K. G. Lee, “Synchronous and asynchronous parallel simulated annealing with multiple Markov chains,” IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 10, pp. 993–1008, 1996. View at Google Scholar · View at Scopus
  7. D. J. Chen, C. Y. Lee, C. H. Park, and P. Mendes, “Parallelizing simulated annealing algorithms based on high-performance computer,” Journal of Global Optimization, vol. 39, no. 2, pp. 261–289, 2007. View at Publisher · View at Google Scholar · View at Scopus
  8. Z. J. Czech, W. Mikanik, and R. Skinderowicz, “Implementing a parallel simulated annealing algorithm,” in Proceedings of the 8th International Conference on Parallel Processing and Applied Mathematics (PPAM'10), vol. 6067 of Lecture Notes in Computer Science, pp. 146–155, Springer, Berlin, Germany, 2010. View at Google Scholar
  9. M. Chateauneuf and D. L. Kreher, “On the state of strength-three covering arrays,” Journal of Combinatorial Designs, vol. 10, no. 4, pp. 217–238, 2002. View at Publisher · View at Google Scholar · View at Scopus
  10. K. Meagher and B. Stevens, “Group construction of covering arrays,” Journal of Combinatorial Designs, vol. 13, no. 1, pp. 70–77, 2005. View at Publisher · View at Google Scholar · View at Scopus
  11. J. R. Lobb, C. J. Colbourn, P. Danziger, B. Stevens, and J. Torres-Jimenez, “Cover starters for covering arrays of strength two,” Discrete Mathematics, vol. 312, no. 5, pp. 943–956, 2012. View at Publisher · View at Google Scholar
  12. D. T. Tang and L. S. Woo, “Exhaustive test pattern generation with constant weight vectors,” IEEE Transactions on Computers, vol. C-32, no. 12, pp. 1145–1150, 1983. View at Google Scholar · View at Scopus
  13. J. Martinez-Pena, J. Torres-Jimenez, N. Rangel-Valdez, and H. Avila-George, “A heuristic approach for constructing ternary covering arrays using trinomial coefficients,” in Proceedings of the 12th Ibero-American Conference on Artificial Intel-Ligence—IBERAMIA, vol. 6433 of Lecture Notes in Computer Science, pp. 572–581, Springer, Berlin, Germany, 2010. View at Google Scholar
  14. C. J. Colbourn, S. S. Martirosyan, G. L. Mullen, D. Shasha, G. B. Sherwood, and J. L. Yucas, “Products of mixed covering arrays of strength two,” Journal of Combinatorial Designs, vol. 14, no. 2, pp. 124–138, 2006. View at Publisher · View at Google Scholar · View at Scopus
  15. Y. W. Tung and W. S. Aldiwan, “Automating test case generation for the new generation mission software system,” in Proceedings of the IEEE Aerospace Conference, vol. 1, pp. 431–437, IEEE Press, March 2000. View at Scopus
  16. R. C. Bryce and C. J. Colbourn, “The density algorithm for pairwise interaction testing,” Software Testing Verification and Reliability, vol. 17, no. 3, pp. 159–182, 2007. View at Publisher · View at Google Scholar · View at Scopus
  17. Y. Lei and K. C. Tai, “In-parameter-order: a test generation strategy for pair-wise testing,” in Proceedings of the 3rd IEEE International Symposium on High-Assurance Systems Engineering (HASE'98), pp. 254–261, IEEE Computer Society, 1998.
  18. Y. Lei, R. Kacker, D. R. Kuhn, V. Okun, and J. Lawrence, “IPOG: a general strategy for T-way software testing,” in Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS'07), pp. 549–556, IEEE Computer Society, Tucson, Ariz, USA, March 2007. View at Publisher · View at Google Scholar · View at Scopus
  19. A. H. Ronneseth and C. J. Colbourn, “Merging covering arrays and compressing multiple sequence alignments,” Discrete Applied Mathematics, vol. 157, no. 9, pp. 2177–2190, 2009. View at Publisher · View at Google Scholar · View at Scopus
  20. K. J. Nurmela, “Upper bounds for covering arrays by tabu search,” Discrete Applied Mathematics, vol. 138, no. 1-2, pp. 143–152, 2004. View at Publisher · View at Google Scholar · View at Scopus
  21. L. Gonzalez-Hernandez, N. Rangel-Valdez, and J. Torres-Jimenez, “Construction of mixed covering arrays of variable strength using a tabu search approach,” in Proceedings of the 4th International Conference on Combinatorial Optimization and Applications (COCOA'10), vol. 6508 of Lecture Notes in Computer Science, pp. 51–64, Springer, Berlin, Germany, 2010. View at Google Scholar
  22. M. B. Cohen, C. J. Colbourn, and A. C. H. Ling, “Augmenting simulated annealing to build interaction test suites,” in Proceedings of the 14th International Symposium on Software Reliability Engineering (ISSRE'03), pp. 394–405, IEEE Computer Society, 2003.
  23. T. Shiba, T. Tsuchiya, and T. Kikuno, “Using artificial life techniques to generate test cases for combinatorial testing,” in Proceedings of the 28th Annual International Computer Software and Applications Conference (COMPSAC'04), vol. 1, pp. 72–77, IEEE Computer Society, September 2004. View at Scopus
  24. J. Torres-Jimenez and E. Rodriguez-Tello, “New bounds for binary covering arrays using simulated annealing,” Information Sciences, vol. 185, no. 1, pp. 137–152, 2012. View at Publisher · View at Google Scholar
  25. Y. Jun and S. Mizuta, “Detailed analysis of uphill moves in temperature parallel simulated annealing and enhancement of exchange probabilities,” Complex Systems, vol. 15, no. 4, pp. 349–358, 2005. View at Google Scholar
  26. L. Cavique, C. Rego, and I. Themido, “Subgraph ejection chains and tabu search for the crew scheduling problem,” Journal of the Operational Research Society, vol. 50, no. 6, pp. 608–616, 1999. View at Google Scholar · View at Scopus
  27. M. M. Atiqullah, “An efficient simple cooling schedule for simulated annealing,” in Proceedings of the International Conference on Computational Science and its Applications (ICCSA'04), vol. 3045 of Lecture Notes in Computer Science, pp. 396–404, Springer, Berlin, Germany, 2004. View at Publisher · View at Google Scholar
  28. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Google Scholar · View at Scopus
  29. Z. Czech, “Three parallel algorithms for simulated annealing,” in Parallel Processing and Applied Mathematics, vol. 2328 of Lecture Notes in Computer Science, pp. 210–217, Springer, Berlin, Germany, 2006. View at Google Scholar
  30. C. J. Colbourn, “Covering array tables for t=2, 3, 4, 5, 6,” 2012, http://www.public.asu.edu/~ccolbou/src/tabby/catable.html.
  31. H. Avila-George, J. Torres-Jimenez, N. Rangel-Valdez, A. Carrión, and V. Hernández, “Supercomputing and a Grid computing on the verification of covering arrays,” The Journal of Supercomputing. In press. View at Publisher · View at Google Scholar