Lower bound and construction of mixed-level locating arrays

E. Chen, Zong-Feng Qi and Yu Tang

Communications in Statistics - Theory and Methods, 2021, vol. 50, issue 19, 4606-4616

Abstract: Covering arrays and locating arrays have been investigated in depth in various scenarios. Test suites based on locating arrays can not only test the presence of system defects, but also identify effects that cause failure according to outcomes. In this article, we first obtain a refined lower bound of test numbers for mixed-level locating arrays, which serves as a benchmark for constructing optimal locating arrays with specific parameters. We also provide an algorithm to construct mixed-level locating arrays aiming to reaching the lower bound. The goal to find a mixed-level locating array is transformed into solving an optimization problem. A simulated annealing algorithm is implemented to approximate a global solution. As a result, a series of mixed-level locating arrays are obtained, which shows that the proposed algorithm is quite effective.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/03610926.2020.1722841 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:lstaxx:v:50:y:2021:i:19:p:4606-4616

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/lsta20

DOI: 10.1080/03610926.2020.1722841

Access Statistics for this article

Communications in Statistics - Theory and Methods is currently edited by Debbie Iscoe

More articles in Communications in Statistics - Theory and Methods from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().