IDEAS home Printed from https://ideas.repec.org/a/taf/japsta/v25y1998i6p817-826.html
   My bibliography  Save this article

Application of genetic algorithms to the construction of exact D-optimal designs

Author

Listed:
  • Grace Montepiedra

Abstract

This paper studies the application of genetic algorithms to the construction of exact D-optimal experimental designs. The concept of genetic algorithms is introduced in the general context of the problem of finding optimal designs. The algorithm is then applied specifically to finding exact D-optimal designs for three different types of model. The performance of genetic algorithms is compared with that of the modified Fedorov algorithm in terms of computing time and relative efficiency. Finally, potential applications of genetic algorithms to other optimality criteria and to other types of model are discussed, along with some open problems for possible future research.

Suggested Citation

  • Grace Montepiedra, 1998. "Application of genetic algorithms to the construction of exact D-optimal designs," Journal of Applied Statistics, Taylor & Francis Journals, vol. 25(6), pages 817-826.
    • Handle: RePEc:taf:japsta:v:25:y:1998:i:6:p:817-826
    DOI: 10.1080/02664769822800
    as

    Download full text from publisher

    File URL: http://www.tandfonline.com/doi/abs/10.1080/02664769822800
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/02664769822800?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. Sung Jung, Joo & Jin Yum, Bong, 1996. "Construction of exact D-optimal designs by tabu search," Computational Statistics & Data Analysis, Elsevier, vol. 21(2), pages 181-191, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Karvanen, Juha & Kulathinal, Sangita & Gasbarra, Dario, 2009. "Optimal designs to select individuals for genotyping conditional on observed binary or survival outcomes and non-genetic covariates," Computational Statistics & Data Analysis, Elsevier, vol. 53(5), pages 1782-1793, March.
    2. Harman, Radoslav & Filová, Lenka, 2014. "Computing efficient exact designs of experiments using integer quadratic programming," Computational Statistics & Data Analysis, Elsevier, vol. 71(C), pages 1159-1167.
    3. CUERVO, Daniel Palhazi & GOOS, Peter & SÖRENSEN, Kenneth, 2013. "An iterated local search algorithm for the construction of large scale D-optimal experimental designs," Working Papers 2013006, University of Antwerp, Faculty of Business and Economics.
    4. Masoudi, Ehsan & Holling, Heinz & Wong, Weng Kee, 2017. "Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs," Computational Statistics & Data Analysis, Elsevier, vol. 113(C), pages 330-345.

    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. CUERVO, Daniel Palhazi & GOOS, Peter & SÖRENSEN, Kenneth, 2013. "An iterated local search algorithm for the construction of large scale D-optimal experimental designs," Working Papers 2013006, University of Antwerp, Faculty of Business and Economics.
    2. Winker, Peter & Gilli, Manfred, 2004. "Applications of optimization heuristics to estimation and modelling problems," Computational Statistics & Data Analysis, Elsevier, vol. 47(2), pages 211-223, September.

    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:japsta:v:25:y:1998:i:6:p:817-826. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/CJAS20 .

    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.