IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v319y2024i2p600-610.html
   My bibliography  Save this article

Sequentially extending space-filling experimental designs by optimally permuting and stacking columns of the design matrix

Author

Listed:
  • Parker, J.D.
  • Lucas, T.W.
  • Carlyle, W.M.

Abstract

Researchers make available computationally expensive designs for computer experiments for widespread use by cataloging them and providing online links. This paper presents an algorithm that augments space-filling designs (SFDs) by optimally permuting and stacking columns of the design matrix to minimize the maximum absolute pairwise correlation among columns in the new extended design. The algorithm enables researchers to augment an SFD sequentially with batches of additional design points, which improves column orthogonality and adds more degrees of freedom for fitting metamodels. We show this method improves the correlation and space-filling properties of the resulting designs and allows us to extend some classes of designs to higher dimensions that are not easily obtainable. Moreover, the resulting extended designs compare well with many leading software-generated SFDs created from scratch in the extended design space.

Suggested Citation

  • Parker, J.D. & Lucas, T.W. & Carlyle, W.M., 2024. "Sequentially extending space-filling experimental designs by optimally permuting and stacking columns of the design matrix," European Journal of Operational Research, Elsevier, vol. 319(2), pages 600-610.
    • Handle: RePEc:eee:ejores:v:319:y:2024:i:2:p:600-610
    DOI: 10.1016/j.ejor.2024.06.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724004685
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2024.06.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. Kleijnen, Jack P.C., 2017. "Regression and Kriging metamodels with their experimental designs in simulation: A review," European Journal of Operational Research, Elsevier, vol. 256(1), pages 1-16.
    2. Zachary C. Little & Jeffery D. Weir & Raymond R. Hill & Brian B. Stone & Jason K. Freels, 2019. "Second-order extensions to nearly orthogonal-and-balanced (NOAB) mixed-factor experimental designs," Journal of Simulation, Taylor & Francis Journals, vol. 13(3), pages 226-237, July.
    3. Jack P. C. Kleijnen & Susan M. Sanchez & Thomas W. Lucas & Thomas M. Cioppa, 2005. "State-of-the-Art Review: A User’s Guide to the Brave New World of Designing Simulation Experiments," INFORMS Journal on Computing, INFORMS, vol. 17(3), pages 263-289, August.
    4. Edwin R. van Dam & Gijs Rennen & Bart Husslage, 2009. "Bounds for Maximin Latin Hypercube Designs," Operations Research, INFORMS, vol. 57(3), pages 595-608, June.
    5. Borgonovo, Emanuele & Plischke, Elmar, 2016. "Sensitivity analysis: A review of recent advances," European Journal of Operational Research, Elsevier, vol. 248(3), pages 869-887.
    6. Thomas W. Lucas & W. David Kelton & Paul J. Sánchez & Susan M. Sanchez & Ben L. Anderson, 2015. "Changing the paradigm: Simulation, now a method of first resort," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(4), pages 293-303, June.
    7. Yaping Wang & Fasheng Sun & Hongquan Xu, 2022. "On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 117(537), pages 375-385, January.
    8. Fasheng Sun & Boxin Tang, 2017. "A Method of Constructing Space-Filling Orthogonal Designs," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 112(518), pages 683-689, April.
    9. V. Roshan Joseph & Evren Gul & Shan Ba, 2015. "Maximum projection designs for computer experiments," Biometrika, Biometrika Trust, vol. 102(2), pages 371-380.
    10. Vieira Jr., Hélcio & Sanchez, Susan & Kienitz, Karl Heinz & Belderrain, Mischel Carmen Neyra, 2011. "Generating and improving orthogonal designs by using mixed integer programming," European Journal of Operational Research, Elsevier, vol. 215(3), pages 629-638, December.
    11. A D MacCalman & H Vieira & T Lucas, 2017. "Second-order nearly orthogonal Latin hypercubes for exploring stochastic simulations," Journal of Simulation, Taylor & Francis Journals, vol. 11(2), pages 137-150, May.
    12. Eugene L. Lawler, 1963. "The Quadratic Assignment Problem," Management Science, INFORMS, vol. 9(4), pages 586-599, July.
    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. Wang, Chunyan & Lin, Dennis K.J., 2024. "Strong orthogonal Latin hypercubes for computer experiments," Computational Statistics & Data Analysis, Elsevier, vol. 198(C).
    2. Tonghui Pang & Yan Wang & Jian-Feng Yang, 2022. "Asymptotically optimal maximin distance Latin hypercube designs," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 85(4), pages 405-418, May.
    3. Wen Shi & Xi Chen & Jennifer Shang, 2019. "An Efficient Morris Method-Based Framework for Simulation Factor Screening," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 745-770, October.
    4. Song-Nan Liu & Min-Qian Liu & Jin-Yu Yang, 2023. "Construction of Column-Orthogonal Designs with Two-Dimensional Stratifications," Mathematics, MDPI, vol. 11(6), pages 1-27, March.
    5. Mu, Weiyan & Xiong, Shifeng, 2018. "A class of space-filling designs and their projection properties," Statistics & Probability Letters, Elsevier, vol. 141(C), pages 129-134.
    6. Siem, A.Y.D. & den Hertog, D., 2007. "Kriging Models That Are Robust With Respect to Simulation Errors," Other publications TiSEM fe73dc8b-20d6-4f50-95eb-f, Tilburg University, School of Economics and Management.
    7. Wu, Zeping & Wang, Wenjie & Wang, Donghui & Zhao, Kun & Zhang, Weihua, 2019. "Global sensitivity analysis using orthogonal augmented radial basis function," Reliability Engineering and System Safety, Elsevier, vol. 185(C), pages 291-302.
    8. Xie, Wei & Barton, Russell R. & Nelson, Barry L. & Wang, Keqi, 2023. "Stochastic simulation uncertainty analysis to accelerate flexible biomanufacturing process development," European Journal of Operational Research, Elsevier, vol. 310(1), pages 238-248.
    9. Vincenzo Varriale & Antonello Cammarano & Francesca Michelino & Mauro Caputo, 2021. "Sustainable Supply Chains with Blockchain, IoT and RFID: A Simulation on Order Management," Sustainability, MDPI, vol. 13(11), pages 1-23, June.
    10. Rennen, G. & Husslage, B.G.M. & van Dam, E.R. & den Hertog, D., 2009. "Nested Maximin Latin Hypercube Designs," Discussion Paper 2009-06, Tilburg University, Center for Economic Research.
    11. Makam, Vaishno Devi & Millossovich, Pietro & Tsanakas, Andreas, 2021. "Sensitivity analysis with χ2-divergences," Insurance: Mathematics and Economics, Elsevier, vol. 100(C), pages 372-383.
    12. Plischke, Elmar & Borgonovo, Emanuele, 2019. "Copula theory and probabilistic sensitivity analysis: Is there a connection?," European Journal of Operational Research, Elsevier, vol. 277(3), pages 1046-1059.
    13. Weiyan Mu & Chengxin Liu & Shifeng Xiong, 2023. "Nested Maximum Entropy Designs for Computer Experiments," Mathematics, MDPI, vol. 11(16), pages 1-12, August.
    14. Leurent, Martin & Jasserand, Frédéric & Locatelli, Giorgio & Palm, Jenny & Rämä, Miika & Trianni, Andrea, 2017. "Driving forces and obstacles to nuclear cogeneration in Europe: Lessons learnt from Finland," Energy Policy, Elsevier, vol. 107(C), pages 138-150.
    15. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
    16. F. Wang & G. H. Huang & Y. Fan & Y. P. Li, 2020. "Robust Subsampling ANOVA Methods for Sensitivity Analysis of Water Resource and Environmental Models," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 34(10), pages 3199-3217, August.
    17. Wu, Xin (Bruce) & Lu, Jiawei & Wu, Shengnan & Zhou, Xuesong (Simon), 2021. "Synchronizing time-dependent transportation services: Reformulation and solution algorithm using quadratic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 152(C), pages 140-179.
    18. Rostami, Borzou & Chassein, André & Hopf, Michael & Frey, Davide & Buchheim, Christoph & Malucelli, Federico & Goerigk, Marc, 2018. "The quadratic shortest path problem: complexity, approximability, and solution methods," European Journal of Operational Research, Elsevier, vol. 268(2), pages 473-485.
    19. Daniel Harenberg & Stefano Marelli & Bruno Sudret & Viktor Winschel, 2019. "Uncertainty quantification and global sensitivity analysis for economic models," Quantitative Economics, Econometric Society, vol. 10(1), pages 1-41, January.
    20. Chiang, Wen-Chyuan & Russell, Robert & Xu, Xiaojing & Zepeda, David, 2009. "A simulation/metaheuristic approach to newspaper production and distribution supply chain problems," International Journal of Production Economics, Elsevier, vol. 121(2), pages 752-767, October.

    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:ejores:v:319:y:2024:i:2:p:600-610. 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/eor .

    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.