IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v50y2021i19p4606-4616.html
   My bibliography  Save this article

Lower bound and construction of mixed-level locating arrays

Author

Listed:
  • E. Chen
  • Zong-Feng Qi
  • Yu Tang

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.

Suggested Citation

  • E. Chen & Zong-Feng Qi & Yu Tang, 2021. "Lower bound and construction of mixed-level locating arrays," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 50(19), pages 4606-4616, August.
    • Handle: RePEc:taf:lstaxx:v:50:y:2021:i:19:p:4606-4616
    DOI: 10.1080/03610926.2020.1722841
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2020.1722841
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2020.1722841?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:50:y:2021:i:19:p:4606-4616. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.