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

Construction of two-level component orthogonal arrays for order-of-addition experiments

Author

Listed:
  • Guangni Mo
  • Yuyao Wang
  • Shuhao Wei
  • Jin Li
  • Hengzhen Huang
  • Xueru Zhang

Abstract

Component orthogonal arrays (COAs), as subsets of all possible permutations on experimental factors, are suitable for designing order-of-addition experiments due to their pairwise balance property between any two positions of the orders. When the levels of components can be changed, the standard statistical design method has been to use the Cartesian product design, which often results in a large number of experimental runs. In this article, we consider combining COAs and 2m−p factional factorial designs by using a Subcartesian product. A systematic method is given for design construction. In the construction method, both the COA and 2m−p design are sliced properly, and then the two designs are combined by the Subcartesian product. We show that the number of runs obtained by the Subcartesian product method is usually much smaller than that obtained by the Cartesian product method. In addition, the constructed design satisfies the pairwise balance property and has the same D-efficiency as the full m!×2m design under the main-effect model. Examples are given to illustrate the proposed method.

Suggested Citation

  • Guangni Mo & Yuyao Wang & Shuhao Wei & Jin Li & Hengzhen Huang & Xueru Zhang, 2024. "Construction of two-level component orthogonal arrays for order-of-addition experiments," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 53(24), pages 8857-8865, December.
  • Handle: RePEc:taf:lstaxx:v:53:y:2024:i:24:p:8857-8865
    DOI: 10.1080/03610926.2024.2301978
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2024.2301978
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2024.2301978?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:53:y:2024:i:24:p:8857-8865. 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.