Skip to main content

Advertisement

SpringerLink
Log in

Using a genetic algorithm to generate D s -optimal designs for mixture experiments in a simplex region

  • Published:
Lobachevskii Journal of Mathematics Aims and scope Submit manuscript

Abstract

We propose and develop a genetic algorithm(GA) to generate D s -optimal or near-optimal mixture designs of a simplex region that maximizes the D s -criterion while simultaneously guaranteeing an acceptable D-efficiency for the mixture experiments. Our method does not need a candidate set which makes it possible to select points throughout a continuous region. Two new GAs are developed to handle specific subsets of quadratic and special cubic mixture model terms. Summaries of GA designs are reported for 3 and 4 mixture components. The performance of GA designs is assessed in comparisons with the designs generated from an exchange algorithm (EA) and SAS Proc OPTEX computer generated designs (CGDs). The results show that the D s -criterion values of the GA designs for all percentage of D-efficiency were greater than or equal to those of the EA and SAS Proc OPTEX designs(CGDs). This suggests that the GA is a effective method for generating subset optimal designs for mixture experiments.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. J. Alvarez, L. Ilzabe, E. Viles, and M. Tanco, Quality Technology and Quantitative Management 6, 295 (2009).

    MathSciNet  Google Scholar 

  2. J. J. Borkowski, J. of Probability and Statistical Science 1, 65 (2003).

    Google Scholar 

  3. L. Davis, Editor, Handbook of Genetic Algorithms (Van Nostrand Reinhold, New York, 1991).

    Google Scholar 

  4. R. L. Haupt and S. E. Haupt, Practical Genetic Algorithms (John Wiley and Sons, New York, 2004).

    MATH  Google Scholar 

  5. A. Heredia-Langner, W. M. Carlyle, D. C. Montgomery, C. M. Borror, and G. C. Runger, J. of Quality Technology 35, 28 (2003).

    Google Scholar 

  6. W. Limmun, J. J. Borkowski, and B. Chomtee, Using a genetic algorithm to generate d-optmal designs for mixture experiments, in Quality and Reliability Engineering International (2012).

    Google Scholar 

  7. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs (Springer-Verlag, New York, 1994).

    Google Scholar 

  8. S. N. Sivanandam and S. N. Deepa, Introduction to Genetic Algorithms (Springer, New York, 2008).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, Faculty of Science, Thammasat University, Thammasat, Thailand

    S. Thongsook & K. Budsaba

  2. Department of Mathematical Sciences, Montana State University, Bozeman, USA

    J. J. Borkowski

Authors
  1. S. Thongsook
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Budsaba
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. J. Borkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. J. Borkowski.

Additional information

Submitted by A. I. Volodin

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Thongsook, S., Budsaba, K. & Borkowski, J.J. Using a genetic algorithm to generate D s -optimal designs for mixture experiments in a simplex region. Lobachevskii J Math 35, 122–137 (2014). https://doi.org/10.1134/S1995080214020103

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1995080214020103

Keywords and phrases

Search

Navigation