A sequential optimal Latin hypercube design method using an efficient recursive permutation evolution algorithm

Author:

Li Guosheng1,Yang Jiawei1,Wu Zeping1ORCID,Zhang Weihua1,Okolo Patrick2ORCID,Zhang Dequan3

Affiliation:

1. College of Aerospace Science and Engineering, National University of Defense Technology, Changsha, People’s Republic of China

2. Mechanical Engineering and Mathematical Sciences, Faculty of Technology, Design and Environment, Oxford Brookes University, Oxford, UK

3. State Key Laboratory of Reliability and Intelligence of Electrical Equipment, School of Mechanical Engineering, Hebei University of Technology, Tianjin, People’s Republic of China

Funder

National Natural Science Foundation of China

Research Project of National University of Defense Technology

Science and Technology Innovation Program of Hunan Province

Publisher

Informa UK Limited

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Control and Optimization,Computer Science Applications

Reference26 articles.

1. Efficiency enhancement of optimized Latin hypercube sampling strategies: Application to Monte Carlo uncertainty analysis and meta-modeling

2. Ba, S. 2015. “SLHD: Maximin-Distance (Sliced) Latin Hypercube Designs.”

3. Bates, Stuart J., Johann Sienz, and Vassili V. Toropov. 2004. “Collection of Technical Papers - AIAA/ASME/ASCE/AHS/ASC Structures.” Structural Dynamics and Materials Conference, Vol. 7, Palm Springs, California, pp. 5217–5223.

4. Sequentially Refined Latin Hypercube Designs: Reusing Every Point

5. A Meshless Solution for the Variable-Order Time Fractional Nonlinear Klein–Gordon Equation

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3