IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i22p4245-d971295.html
   My bibliography  Save this article

Improved G -Optimal Designs for Small Exact Response Surface Scenarios: Fast and Efficient Generation via Particle Swarm Optimization

Author

Listed:
  • Stephen J. Walsh

    (Department of Mathematics and Statistics, Utah State University, Logan, UT 84322, USA)

  • John J. Borkowski

    (Department of Mathematical Sciences, Montana State University, Bozeman, MT 59717, USA)

Abstract

G -optimal designs are those which minimize the worst-case prediction variance. Thus, such designs are of interest if prediction is a primary component of the post-experiment analysis and decision making. G -optimal designs have not attained widespread use in practical applications, in part, because they are difficult to compute. In this paper, we review the last two decades of algorithm development for generating exact G -optimal designs. To date, Particle Swarm Optimization (PSO) has not been applied to construct exact G -optimal designs for small response surface scenarios commonly encountered in industrial settings. We were able to produce improved G -optimal designs for the second-order model and several sample sizes under experiments with K = 1 , 2 , 3 , 4 , and 5 design factors using an adaptation of PSO. Thereby, we publish updated knowledge on the best-known exact G -optimal designs. We compare computing cost/time and algorithm efficacy to all previous published results including those generated by the current state-of-the-art (SOA) algorithm, the G ( I λ ) -coordinate exchange. PSO is hereby demonstrated to produce better designs than the SOA at commensurate cost. In all, the results of this paper suggest PSO should be adopted by more practitioners as a tool for generating exact optimal designs.

Suggested Citation

  • Stephen J. Walsh & John J. Borkowski, 2022. "Improved G -Optimal Designs for Small Exact Response Surface Scenarios: Fast and Efficient Generation via Particle Swarm Optimization," Mathematics, MDPI, vol. 10(22), pages 1-17, November.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:22:p:4245-:d:971295
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/22/4245/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/22/4245/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Weng Kee Wong & Ray-Bing Chen & Chien-Chih Huang & Weichung Wang, 2015. "A Modified Particle Swarm Optimization Technique for Finding Optimal Designs for Mixture Models," PLOS ONE, Public Library of Science, vol. 10(6), pages 1-23, June.
    2. Chen, Ray-Bing & Hsu, Yen-Wen & Hung, Ying & Wang, Weichung, 2014. "Discrete particle swarm optimization for constructing uniform design on irregular regions," Computational Statistics & Data Analysis, Elsevier, vol. 72(C), pages 282-297.
    3. Yu Shi & Zizhao Zhang & Weng Kee Wong, 2019. "Particle swarm based algorithms for finding locally and Bayesian D-optimal designs," Journal of Statistical Distributions and Applications, Springer, vol. 6(1), pages 1-17, December.
    4. Chang Li & Daniel C. Coster, 2014. "A Simulated Annealing Algorithm for D-Optimal Design for 2-Way and 3-Way Polynomial Regression with Correlated Observations," Journal of Applied Mathematics, Hindawi, vol. 2014, pages 1-6, March.
    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. Saeid Pooladsaz & Mahboobeh Doosti-Irani, 2024. "An algorithm for generating efficient block designs via a novel particle swarm approach," Computational Statistics, Springer, vol. 39(5), pages 2437-2449, July.

    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. Saeid Pooladsaz & Mahboobeh Doosti-Irani, 2024. "An algorithm for generating efficient block designs via a novel particle swarm approach," Computational Statistics, Springer, vol. 39(5), pages 2437-2449, July.
    2. Xiao, Qian & Xu, Hongquan, 2021. "A mapping-based universal Kriging model for order-of-addition experiments in drug combination studies," Computational Statistics & Data Analysis, Elsevier, vol. 157(C).
    3. Haoyu Wang & Chongqi Zhang, 2022. "The mixture design threshold accepting algorithm for generating $$\varvec{D}$$ D -optimal designs of the mixture models," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 85(3), pages 345-371, April.
    4. Saeid Pooladsaz & Mahboobeh Doosti-Irani, 2020. "An algorithm for finding efficient test-control block designs with correlated observations," Computational Statistics, Springer, vol. 35(2), pages 821-836, June.
    5. García-Ródenas, Ricardo & García-García, José Carlos & López-Fidalgo, Jesús & Martín-Baos, José Ángel & Wong, Weng Kee, 2020. "A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs," Computational Statistics & Data Analysis, Elsevier, vol. 144(C).
    6. Wael Korani & Malek Mouhoub, 2021. "Review on Nature-Inspired Algorithms," SN Operations Research Forum, Springer, vol. 2(3), pages 1-26, September.
    7. Aiste Ruseckaite & Peter Goos & Dennis Fok, 2017. "Bayesian D-optimal choice designs for mixtures," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 66(2), pages 363-386, February.
    8. 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.
    9. Dongying Wang & Sumin Wang, 2023. "Constructing Optimal Designs for Order-of-Addition Experiments Using a Hybrid Algorithm," Mathematics, MDPI, vol. 11(11), pages 1-20, May.
    10. Xiao-Dong Zhou & Yun-Juan Wang & Rong-Xian Yue, 2018. "Robust population designs for longitudinal linear regression model with a random intercept," Computational Statistics, Springer, vol. 33(2), pages 903-931, June.

    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:gam:jmathe:v:10:y:2022:i:22:p:4245-:d:971295. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.