IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v8y2017i2d10.1007_s13198-016-0430-6.html
   My bibliography  Save this article

Construction of t-way covering arrays using genetic algorithm

Author

Listed:
  • Sangeeta Sabharwal

    (Netaji Subhas Institute of Technology)

  • Priti Bansal

    (Netaji Subhas Institute of Technology)

  • Nitish Mittal

    (Netaji Subhas Institute of Technology)

Abstract

In a component based system, interaction among components may give rise to interaction faults. Faults can be caused by the interactions of two or more than two components. Since, it is not feasible to test all possible interactions combinatorial interaction testing is being employed to generate covering arrays (CAs) that covers all t-way interactions between components. In this paper, we generalize our previous work, that uses a greedy based genetic algorithm, to generate CA from 2-way to t-way testing (2 ≤ t ≤ 4). We implement the proposed strategy by extending an open source tool PWiseGen. The main drawback of PWiseGen is the need to input the size of CA in advance. To overcome this restriction of PWiseGen, we propose a variation of binary search algorithm that generates optimal CA without knowing its size in advance. Experiments are conducted to evaluate the effectiveness of the proposed approach and it has been observed that the proposed approach performs well as compared to existing state-of-the-art algorithms.

Suggested Citation

  • Sangeeta Sabharwal & Priti Bansal & Nitish Mittal, 2017. "Construction of t-way covering arrays using genetic algorithm," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 8(2), pages 264-274, June.
  • Handle: RePEc:spr:ijsaem:v:8:y:2017:i:2:d:10.1007_s13198-016-0430-6
    DOI: 10.1007/s13198-016-0430-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-016-0430-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s13198-016-0430-6?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Torres-Jimenez, Jose & Acevedo-Juárez, Brenda & Avila-George, Himer, 2021. "Covering array EXtender," Applied Mathematics and Computation, Elsevier, vol. 402(C).

    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:spr:ijsaem:v:8:y:2017:i:2:d:10.1007_s13198-016-0430-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.