Lobachevskii Journal of Mathematics

, Volume 35, Issue 2, pp 122–137 | Cite as

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

Article

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.

Keywords and phrases

exchange algorithm genetic algorithm optimal design mixture experiment subset optimality 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. J. Alvarez, L. Ilzabe, E. Viles, and M. Tanco, Quality Technology and Quantitative Management 6, 295 (2009).MathSciNetGoogle Scholar
  2. 2.
    J. J. Borkowski, J. of Probability and Statistical Science 1, 65 (2003).Google Scholar
  3. 3.
    L. Davis, Editor, Handbook of Genetic Algorithms (Van Nostrand Reinhold, New York, 1991).Google Scholar
  4. 4.
    R. L. Haupt and S. E. Haupt, Practical Genetic Algorithms (John Wiley and Sons, New York, 2004).MATHGoogle Scholar
  5. 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. 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. 7.
    Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs (Springer-Verlag, New York, 1994).Google Scholar
  8. 8.
    S. N. Sivanandam and S. N. Deepa, Introduction to Genetic Algorithms (Springer, New York, 2008).MATHGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2014

Authors and Affiliations

  1. 1.Department of Mathematics and Statistics, Faculty of ScienceThammasat UniversityThammasatThailand
  2. 2.Department of Mathematical SciencesMontana State UniversityBozemanUSA

Personalised recommendations