New Bounds for Ternary Covering Arrays Using a Parallel Simulated Annealing
Joint Authors
Avila-George, Himer
Torres-Jimenez, Jose
Hernández, Vicente
Source
Mathematical Problems in Engineering
Issue
Vol. 2012, Issue 2012 (31 Dec. 2012), pp.1-19, 19 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2012-08-26
Country of Publication
Egypt
No. of Pages
19
Main Subjects
Abstract EN
A covering array (CA) is a combinatorial structure specified as a matrix of N rows and k columns over an alphabet on v symbols such that for each set of t columns every t-tuple of symbols is covered at least once.
Given the values of t, k, and v, the optimal covering array construction problem (CAC) consists in constructing a CA (N; t, k, v) with the minimum possible value of N.
There are several reported methods to attend the CAC problem, among them are direct methods, recursive methods, greedy methods, and metaheuristics methods.
In this paper, There are three parallel approaches for simulated annealing: the independent, semi-independent, and cooperative searches are applied to the CAC problem.
The empirical evidence supported by statistical analysis indicates that cooperative approach offers the best execution times and the same bounds as the independent and semi-independent approaches.
Extensive experimentation was carried out, using 182 well-known benchmark instances of ternary covering arrays, for assessing its performance with respect to the best-known bounds reported previously.
The results show that cooperative approach attains 134 new bounds and equals the solutions for other 29 instances.
American Psychological Association (APA)
Avila-George, Himer& Torres-Jimenez, Jose& Hernández, Vicente. 2012. New Bounds for Ternary Covering Arrays Using a Parallel Simulated Annealing. Mathematical Problems in Engineering،Vol. 2012, no. 2012, pp.1-19.
https://search.emarefa.net/detail/BIM-1002219
Modern Language Association (MLA)
Avila-George, Himer…[et al.]. New Bounds for Ternary Covering Arrays Using a Parallel Simulated Annealing. Mathematical Problems in Engineering No. 2012 (2012), pp.1-19.
https://search.emarefa.net/detail/BIM-1002219
American Medical Association (AMA)
Avila-George, Himer& Torres-Jimenez, Jose& Hernández, Vicente. New Bounds for Ternary Covering Arrays Using a Parallel Simulated Annealing. Mathematical Problems in Engineering. 2012. Vol. 2012, no. 2012, pp.1-19.
https://search.emarefa.net/detail/BIM-1002219
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1002219