IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v137y2019icp101-114.html
   My bibliography  Save this article

An algorithm for generating good mixed level factorial designs

Author

Listed:
  • Grömping, Ulrike
  • Fontana, Roberto

Abstract

An algorithm for the creation of mixed level arrays with generalized minimum aberration (GMA) is proposed. GMA mixed level arrays are particularly useful for experiments involving qualitative factors: for these, the number of factor levels is often a consequence of subject matter requirements, while a priori assumptions on a statistical model are not made, apart from assuming lower order effects to be more important than higher order effects. The proposed algorithm creates GMA arrays using mixed integer optimization with conic quadratic constraints. Fully achieving GMA is feasible for small problems; for larger problems, the optimization task is reduced to considering the confounding of low-order effects only. Lower bounds for the lowest-order confounding are provided (given the number of experimental runs). Where one of these bounds is actually attainable, the algorithm is often fast in providing an array which attains it. Examples illustrate the scope and usefulness of the algorithm, which is implemented in an R package, using one of two commercial optimizers.

Suggested Citation

  • Grömping, Ulrike & Fontana, Roberto, 2019. "An algorithm for generating good mixed level factorial designs," Computational Statistics & Data Analysis, Elsevier, vol. 137(C), pages 101-114.
  • Handle: RePEc:eee:csdana:v:137:y:2019:i:c:p:101-114
    DOI: 10.1016/j.csda.2019.01.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947319300350
    Download Restriction: Full text for ScienceDirect subscribers only.

    File URL: https://libkey.io/10.1016/j.csda.2019.01.020?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.

    References listed on IDEAS

    as
    1. Kobilinsky, André & Monod, Hervé & Bailey, R.A., 2017. "Automatic generation of generalised regular factorial designs," Computational Statistics & Data Analysis, Elsevier, vol. 113(C), pages 311-329.
    2. Roberto Fontana, 2017. "Generalized minimum aberration mixed-level orthogonal arrays: A general approach based on sequential integer quadratically constrained quadratic programming," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 46(9), pages 4275-4284, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yaquelin Verenice Pantoja-Pacheco & Armando Javier Ríos-Lira & José Antonio Vázquez-López & José Alfredo Jiménez-García & Martha Laura Asato-España & Moisés Tapia-Esquivias, 2021. "One Note for Fractionation and Increase for Mixed-Level Designs When the Levels Are Not Multiple," Mathematics, MDPI, vol. 9(13), pages 1-20, June.
    2. Rouger, Baptiste & Goldringer, Isabelle & Barbillon, Pierre & Miramon, Anne & Naino Jika, Abdel Kader & Thomas, Mathieu, 2023. "Sensitivity analysis of a crop metapopulation model," Ecological Modelling, Elsevier, vol. 475(C).
    3. Olivier David & Arnaud Le Rouzic & Christine Dillmann, 2022. "Optimization of sampling designs for pedigrees and association studies," Biometrics, The International Biometric Society, vol. 78(3), pages 1056-1066, September.

    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:eee:csdana:v:137:y:2019:i:c:p:101-114. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    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.