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

MP-CE Method for Space-Filling Design in Constrained Space with Multiple Types of Factors

Author

Listed:
  • Yang You

    (College of Systems Engineering, National University of Defense Technology, Changsha 410073, China
    Academy of Systems Engineering, Academy of Military Sciences, Beijing 102300, China)

  • Guang Jin

    (College of Systems Engineering, National University of Defense Technology, Changsha 410073, China)

  • Zhengqiang Pan

    (College of Systems Engineering, National University of Defense Technology, Changsha 410073, China)

  • Rui Guo

    (Academy of Systems Engineering, Academy of Military Sciences, Beijing 102300, China)

Abstract

Space-filling design selects points uniformly in the experimental space, bringing considerable flexibility to the complex-model-based and model-free data analysis. At present, space-filling designs mostly focus on regular spaces and continuous factors, with a lack of studies into the discrete factors and the constraints among factors. Most of the existing experimental design methods for qualitative factors are not applicable for discrete factors, since they ignore the potential order or spatial distance between discrete factors. This paper proposes a space-filling method, called maximum projection coordinate-exchange (MP-CE), taking into account both the diversity of factor types and the complexity of factor constraints. Specifically, the maximum projection criterion and distance criterion are introduced to capture the “bad” coordinates, and the coordinate-exchange and the optimization of experimental design are realized by solving one-dimensional constrained optimization problem. Meanwhile, by adding iterative perturbations to the traditional coordinate exchange process, the adjacent areas of the local optimal solution are explored and the optimum performances of the current optimal solution are retained, while the shortcomings of random restart are effectively avoided. Experiments in the regular space and constraint space, as well as experimental design for the terminal interception effectiveness of a missile defense system, show that the MP-CE method significantly outperforms existing popular space-filling design methods in terms of space-projection properties, while yielding comparable or superior space-filling properties.

Suggested Citation

  • Yang You & Guang Jin & Zhengqiang Pan & Rui Guo, 2021. "MP-CE Method for Space-Filling Design in Constrained Space with Multiple Types of Factors," Mathematics, MDPI, vol. 9(24), pages 1-13, December.
  • Handle: RePEc:gam:jmathe:v:9:y:2021:i:24:p:3314-:d:706168
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/24/3314/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/9/24/3314/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. V. Roshan Joseph & Evren Gul & Shan Ba, 2015. "Maximum projection designs for computer experiments," Biometrika, Biometrika Trust, vol. 102(2), pages 371-380.
    2. Peter Z. G. Qian, 2012. "Sliced Latin Hypercube Designs," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 107(497), pages 393-399, March.
    3. Jing Zhang & Jin Xu & Kai Jia & Yimin Yin & Zhengming Wang, 2019. "Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes," Mathematics, MDPI, vol. 7(9), pages 1-16, September.
    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. Ray, Douglas & Ramirez-Marquez, Jose, 2020. "A framework for probabilistic model-based engineering and data synthesis," Reliability Engineering and System Safety, Elsevier, vol. 193(C).
    2. 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.
    3. Francisco Castillo-Zunino & Pinar Keskinocak, 2021. "Bi-criteria multiple knapsack problem with grouped items," Journal of Heuristics, Springer, vol. 27(5), pages 747-789, October.
    4. Zeng, Yaohui & Zhang, Zijun & Kusiak, Andrew, 2015. "Predictive modeling and optimization of a multi-zone HVAC system with data mining and firefly algorithms," Energy, Elsevier, vol. 86(C), pages 393-402.
    5. Li, Min & Liu, Min-Qian & Wang, Xiao-Lei & Zhou, Yong-Dao, 2020. "Prediction for computer experiments with both quantitative and qualitative factors," Statistics & Probability Letters, Elsevier, vol. 165(C).
    6. 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.
    7. Jing Zhang & Jin Xu & Kai Jia & Yimin Yin & Zhengming Wang, 2019. "Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes," Mathematics, MDPI, vol. 7(9), pages 1-16, September.
    8. Vikram V. Garg & Roy H. Stogner, 2017. "Hierarchical Latin Hypercube Sampling," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 112(518), pages 673-682, April.
    9. Yue Huan & Yubin Tian & Dianpeng Wang, 2022. "A Weighted Surrogate Model for Spatio-Temporal Dynamics with Multiple Time Spans: Applications for the Pollutant Concentration of the Bai River," Mathematics, MDPI, vol. 10(19), pages 1-16, October.
    10. Xueru Zhang & Dennis K. J. Lin & Lin Wang, 2023. "Digital Triplet: A Sequential Methodology for Digital Twin Learning," Mathematics, MDPI, vol. 11(12), pages 1-16, June.
    11. 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.
    12. Yang, Xue & Chen, Hao & Liu, Min-Qian, 2014. "Resolvable orthogonal array-based uniform sliced Latin hypercube designs," Statistics & Probability Letters, Elsevier, vol. 93(C), pages 108-115.
    13. Guillaume Perrin & Christian Soize, 2020. "Adaptive method for indirect identification of the statistical properties of random fields in a Bayesian framework," Computational Statistics, Springer, vol. 35(1), pages 111-133, March.
    14. Arvind Krishna & Huan Tran & Chaofan Huang & Rampi Ramprasad & V. Roshan Joseph, 2024. "Adaptive Exploration and Optimization of Materials Crystal Structures," INFORMS Joural on Data Science, INFORMS, vol. 3(1), pages 68-83, April.
    15. Guo, Hongqiang & Lu, Silong & Hui, Hongzhong & Bao, Chunjiang & Shangguan, Jinyong, 2019. "Receding horizon control-based energy management for plug-in hybrid electric buses using a predictive model of terminal SOC constraint in consideration of stochastic vehicle mass," Energy, Elsevier, vol. 176(C), pages 292-308.
    16. Xiangshun Kong & Mingyao Ai & Kwok Leung Tsui, 2018. "Flexible sliced designs for computer experiments," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 70(3), pages 631-646, June.
    17. Chen, Hao & Yang, Jinyu & Lin, Dennis K.J. & Liu, Min-Qian, 2019. "Sliced Latin hypercube designs with both branching and nested factors," Statistics & Probability Letters, Elsevier, vol. 146(C), pages 124-131.
    18. Weiping Zhou & Jinyu Yang & Min-Qian Liu, 2021. "Construction of orthogonal marginally coupled designs," Statistical Papers, Springer, vol. 62(4), pages 1795-1820, August.
    19. Hao Chen & Yan Zhang & Xue Yang, 2021. "Uniform projection nested Latin hypercube designs," Statistical Papers, Springer, vol. 62(4), pages 2031-2045, August.
    20. Wang, Xiao-Lei & Zhao, Yu-Na & Yang, Jian-Feng & Liu, Min-Qian, 2017. "Construction of (nearly) orthogonal sliced Latin hypercube designs," Statistics & Probability Letters, Elsevier, vol. 125(C), pages 174-180.

    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:9:y:2021:i:24:p:3314-:d:706168. 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.