{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T05:46:55Z","timestamp":1776750415219,"version":"3.51.2"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,12,11]],"date-time":"2022-12-11T00:00:00Z","timestamp":1670716800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,11]],"date-time":"2022-12-11T00:00:00Z","timestamp":1670716800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2018YFB1702502"],"award-info":[{"award-number":["2018YFB1702502"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52075068"],"award-info":[{"award-number":["52075068"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Engineering with Computers"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s00366-022-01769-5","type":"journal-article","created":{"date-parts":[[2022,12,11]],"date-time":"2022-12-11T03:02:12Z","timestamp":1670727732000},"page":"3509-3526","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Latin hypervolume design for irregular sampling spaces and its application in the analysis of cracks"],"prefix":"10.1007","volume":"39","author":[{"given":"Yong","family":"Pang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liangliang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yitang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaonan","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8235-5870","authenticated-orcid":false,"given":"Xueguan","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,11]]},"reference":[{"key":"1769_CR1","doi-asserted-by":"publisher","first-page":"1975","DOI":"10.1002\/qre.1924","volume":"32","author":"FAC Viana","year":"2016","unstructured":"Viana FAC (2016) A tutorial on Latin hypercube design of experiments. Qual Reliab Eng Int 32:1975\u20131985. https:\/\/doi.org\/10.1002\/qre.1924","journal-title":"Qual Reliab Eng Int"},{"key":"1769_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1115\/1.4053011","volume":"144","author":"Y Pang","year":"2022","unstructured":"Pang Y, Wang Y, Sun W, Song X (2022) OTL-PEM: an optimization-based two-layer pointwise ensemble of surrogate Models. J Mech Des 144:1\u201314. https:\/\/doi.org\/10.1115\/1.4053011","journal-title":"J Mech Des"},{"key":"1769_CR3","doi-asserted-by":"publisher","unstructured":"Lai X, Wang S, Guo Z, Zhang C, Sun W, Song X (2021) Designing a shape-performance integrated digital twin based on multiple models and dynamic data: a boom crane example. J Mech Des Trans ASME. https:\/\/doi.org\/10.1115\/1.4049861","DOI":"10.1115\/1.4049861"},{"key":"1769_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00366-020-01145-1","volume":"38","author":"Z Zhai","year":"2020","unstructured":"Zhai Z, Li H, Wang X (2020) An adaptive sampling method for Kriging surrogate model with multiple outputs. Eng Comput 38:277\u2013295. https:\/\/doi.org\/10.1007\/s00366-020-01145-1","journal-title":"Eng Comput"},{"key":"1769_CR5","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s00366-019-00844-8","volume":"37","author":"Q Zhou","year":"2021","unstructured":"Zhou Q, Wu J, Xue T, Jin P (2021) A two-stage adaptive multi-fidelity surrogate model-assisted multi-objective genetic algorithm for computationally expensive problems. Eng Comput 37:623\u2013639. https:\/\/doi.org\/10.1007\/s00366-019-00844-8","journal-title":"Eng Comput"},{"key":"1769_CR6","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s00366-014-0372-z","volume":"31","author":"Y Tenne","year":"2015","unstructured":"Tenne Y (2015) Initial sampling methods in metamodel-assisted optimization. Eng Comput 31:661\u2013680. https:\/\/doi.org\/10.1007\/s00366-014-0372-z","journal-title":"Eng Comput"},{"key":"1769_CR7","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1198\/004017003000000168","volume":"45","author":"E Stinstra","year":"2003","unstructured":"Stinstra E, Stehouwer P, Den Hertog D, Vestjens A (2003) Constrained maximin designs for computer experiments. Technometrics 45:340\u2013346. https:\/\/doi.org\/10.1198\/004017003000000168","journal-title":"Technometrics"},{"key":"1769_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1080\/00401706.2000.10485979","volume":"42","author":"MD McKay","year":"2000","unstructured":"McKay MD, Beckman RJ, Conover WJ (2000) A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 42:55\u201361. https:\/\/doi.org\/10.1080\/00401706.2000.10485979","journal-title":"Technometrics"},{"key":"1769_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.matdes.2021.109789","volume":"206","author":"D Meng","year":"2021","unstructured":"Meng D, Li Y, He C, Guo J, Lv Z, Wu P (2021) Multidisciplinary design for structural integrity using a collaborative optimization method based on adaptive surrogate modelling. Mater Des 206:109789. https:\/\/doi.org\/10.1016\/j.matdes.2021.109789","journal-title":"Mater Des"},{"key":"1769_CR10","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1109\/TEVC.2018.2869247","volume":"23","author":"J Tian","year":"2019","unstructured":"Tian J, Tan Y, Zeng J, Sun C, Jin Y (2019) Multiobjective infill criterion driven Gaussian process-assisted particle swarm optimization of high-dimensional expensive problems. IEEE Trans Evol Comput 23:459\u2013472","journal-title":"IEEE Trans Evol Comput"},{"key":"1769_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-021-01544-y","volume-title":"Stochastic bending and buckling analysis of laminated composite plates using Latin hypercube sampling","author":"MC Trinh","year":"2021","unstructured":"Trinh MC, Jun H (2021) Stochastic bending and buckling analysis of laminated composite plates using Latin hypercube sampling. Springer, London. https:\/\/doi.org\/10.1007\/s00366-021-01544-y"},{"key":"1769_CR12","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1002\/qre.1640","volume":"31","author":"R Lekivetz","year":"2015","unstructured":"Lekivetz R, Jones B (2015) Fast flexible space-filling designs for nonrectangular regions. Qual Reliab Eng Int 31:829\u2013837. https:\/\/doi.org\/10.1002\/qre.1640","journal-title":"Qual Reliab Eng Int"},{"key":"1769_CR13","unstructured":"Aziz A (2019) EC-030 statistical analysis of various optimal latin hypercube designs, pp\u00a0187\u2013190"},{"key":"1769_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/00224065.2009.11917758","volume":"41","author":"JJ Borkowski","year":"2009","unstructured":"Borkowski JJ, Piepel GF (2009) Uniform designs for highly constrained mixture experiments. J Qual Technol 41:35\u201347. https:\/\/doi.org\/10.1080\/00224065.2009.11917758","journal-title":"J Qual Technol"},{"key":"1769_CR15","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1287\/opre.1060.0317","volume":"55","author":"ER Van Dam","year":"2007","unstructured":"Van Dam ER, Husslage B, Den Hertog D, Melissen H (2007) Maximin Latin hypercube designs in two dimensions. Oper Res 55:158\u2013169. https:\/\/doi.org\/10.1287\/opre.1060.0317","journal-title":"Oper Res"},{"key":"1769_CR16","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0378-3758(94)00035-T","volume":"43","author":"MD Morris","year":"1995","unstructured":"Morris MD, Mitchell TJ (1995) Exploratory designs for computational experiments. J Stat Plan Inference 43:381\u2013402. https:\/\/doi.org\/10.1016\/0378-3758(94)00035-T","journal-title":"J Stat Plan Inference"},{"key":"1769_CR17","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1080\/0305215X.2011.591790","volume":"44","author":"H Zhu","year":"2012","unstructured":"Zhu H, Liu L, Long T, Peng L (2012) A novel algorithm of maximin Latin hypercube design using successive local enumeration. Eng Optim 44:551\u2013564. https:\/\/doi.org\/10.1080\/0305215X.2011.591790","journal-title":"Eng Optim"},{"key":"1769_CR18","doi-asserted-by":"publisher","first-page":"5217","DOI":"10.2514\/6.2004-2011","volume":"7","author":"SJ Bates","year":"2004","unstructured":"Bates SJ, Sienz J, Toropov VV (2004) Formulation of the optimal Latin hypercube design of experiments using a permutation genetic algorithm. Collect. Tech Pap. AIAA\/ASME\/ASCE\/AHS\/ASC Struct. Struct. Dyn. Mater. Conf. 7:5217\u20135223. https:\/\/doi.org\/10.2514\/6.2004-2011","journal-title":"Collect. Tech Pap. AIAA\/ASME\/ASCE\/AHS\/ASC Struct. Struct. Dyn. Mater. Conf."},{"key":"1769_CR19","doi-asserted-by":"publisher","unstructured":"Aziz M, Tayarani MHN (2014) An adaptive memetic Particle Swarm Optimization algorithm for finding large-scale Latin hypercube designs. Eng Appl Artif Intell 36:222\u2013237. https:\/\/doi.org\/10.1016\/j.engappai.2014.07.021","DOI":"10.1016\/j.engappai.2014.07.021"},{"key":"1769_CR20","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/s0025-5718-00-01281-3","volume":"71","author":"K-T Fang","year":"2000","unstructured":"Fang K-T, Ma C-X, Winker P (2000) Centered $L_2$-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs. Math Comput 71:275\u2013297. https:\/\/doi.org\/10.1090\/s0025-5718-00-01281-3","journal-title":"Math Comput"},{"key":"1769_CR21","doi-asserted-by":"publisher","first-page":"1780","DOI":"10.1080\/00207721.2013.835003","volume":"46","author":"N Pholdee","year":"2015","unstructured":"Pholdee N, Bureerat S (2015) An efficient optimum Latin hypercube sampling technique based on sequencing optimisation using simulated annealing. Int J Syst Sci 46:1780\u20131789. https:\/\/doi.org\/10.1080\/00207721.2013.835003","journal-title":"Int J Syst Sci"},{"key":"1769_CR22","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/s0378-3758(00)00105-1","volume":"90","author":"KQ Ye","year":"2000","unstructured":"Ye KQ, Li W, Sudjianto A (2000) Algorithmic construction of optimal symmetric Latin hypercube designs. J Stat Plan Inference 90:145\u2013159. https:\/\/doi.org\/10.1016\/s0378-3758(00)00105-1","journal-title":"J Stat Plan Inference"},{"key":"1769_CR23","doi-asserted-by":"publisher","first-page":"3231","DOI":"10.1016\/j.jspi.2005.01.007","volume":"136","author":"M Liefvendahl","year":"2006","unstructured":"Liefvendahl M, Stocki R (2006) A study on algorithms for optimization of Latin hypercubes. J Stat Plan Inference 136:3231\u20133247. https:\/\/doi.org\/10.1016\/j.jspi.2005.01.007","journal-title":"J Stat Plan Inference"},{"key":"1769_CR24","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1080\/0305215X.2019.1584618","volume":"52","author":"X Shang","year":"2020","unstructured":"Shang X, Chao T, Ma P, Yang M (2020) An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design. Eng Optim 52:271\u2013287. https:\/\/doi.org\/10.1080\/0305215X.2019.1584618","journal-title":"Eng Optim"},{"key":"1769_CR25","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s11222-012-9363-3","volume":"23","author":"RB Chen","year":"2013","unstructured":"Chen RB, Hsieh DN, Hung Y, Wang W (2013) Optimizing Latin hypercube designs by particle swarm. Stat Comput 23:663\u2013676. https:\/\/doi.org\/10.1007\/s11222-012-9363-3","journal-title":"Stat Comput"},{"key":"1769_CR26","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.jspi.2004.02.014","volume":"134","author":"R Jin","year":"2005","unstructured":"Jin R, Chen W, Sudjianto A (2005) An efficient algorithm for constructing optimal design of computer experiments. J Stat Plan Inference 134:268\u2013287. https:\/\/doi.org\/10.1016\/j.jspi.2004.02.014","journal-title":"J Stat Plan Inference"},{"key":"1769_CR27","doi-asserted-by":"publisher","first-page":"2549","DOI":"10.1080\/00949655.2017.1340475","volume":"87","author":"W Li","year":"2017","unstructured":"Li W, Lu L, Xie X, Yang M (2017) A novel extension algorithm for optimized Latin hypercube sampling. J Stat Comput Simul 87:2549\u20132559. https:\/\/doi.org\/10.1080\/00949655.2017.1340475","journal-title":"J Stat Comput Simul"},{"key":"1769_CR28","doi-asserted-by":"publisher","DOI":"10.1002\/nme","author":"FAC Viana","year":"2012","unstructured":"Viana FAC, Venter G, Balabanov V (2012) An algorithm for fast optimal Latin hypercube design of experiments. Int J Numer Methods Eng. https:\/\/doi.org\/10.1002\/nme","journal-title":"Int J Numer Methods Eng"},{"key":"1769_CR29","doi-asserted-by":"publisher","unstructured":"Pan G, Ye P, Wang P (2014) A novel latin hypercube algorithm via translational propagation. Sci World J. https:\/\/doi.org\/10.1155\/2014\/163949","DOI":"10.1155\/2014\/163949"},{"key":"1769_CR30","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.compchemeng.2017.05.010","volume":"106","author":"SS Garud","year":"2017","unstructured":"Garud SS, Karimi IA, Kraft M (2017) Design of computer experiments: a review. Comput Chem Eng 106:71\u201395. https:\/\/doi.org\/10.1016\/j.compchemeng.2017.05.010","journal-title":"Comput Chem Eng"},{"key":"1769_CR31","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/TEVC.2017.2669098","volume":"21","author":"Y Wang","year":"2017","unstructured":"Wang Y, Xu B, Sun G, Yang S (2017) A two-phase differential evolution for uniform designs in constrained experimental domains. IEEE Trans Evol Comput 21:665\u2013680. https:\/\/doi.org\/10.1109\/TEVC.2017.2669098","journal-title":"IEEE Trans Evol Comput"},{"key":"1769_CR32","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1080\/10618600.2017.1302881","volume":"27","author":"S Mak","year":"2018","unstructured":"Mak S, Joseph VR (2018) Minimax and minimax projection designs using clustering. J Comput Graph Stat 27:166\u2013178. https:\/\/doi.org\/10.1080\/10618600.2017.1302881","journal-title":"J Comput Graph Stat"},{"key":"1769_CR33","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10182-010-0144-z","volume":"94","author":"M Petelet","year":"2010","unstructured":"Petelet M, Iooss B, Asserin O, Loredo A (2010) Latin hypercube sampling with inequality constraints. AStA Adv Stat Anal 94:325\u2013339. https:\/\/doi.org\/10.1007\/s10182-010-0144-z","journal-title":"AStA Adv Stat Anal"},{"key":"1769_CR34","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1080\/00401706.2012.676951","volume":"54","author":"D Dragulji\u00e9","year":"2012","unstructured":"Dragulji\u00e9 D, Dean AM, Santner TJ (2012) Noncollapsing space-filling designs for bounded nonrectangular regions. Technometrics 54:169\u2013178. https:\/\/doi.org\/10.1080\/00401706.2012.676951","journal-title":"Technometrics"},{"key":"1769_CR35","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1016\/j.advengsoft.2011.05.004","volume":"42","author":"F Fuerle","year":"2011","unstructured":"Fuerle F, Sienz J (2011) Formulation of the audze-eglais uniform Latin hypercube design of experiments for constrained design spaces. Adv Eng Softw 42:680\u2013689. https:\/\/doi.org\/10.1016\/j.advengsoft.2011.05.004","journal-title":"Adv Eng Softw"},{"key":"1769_CR36","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.compstruc.2012.11.014","volume":"119","author":"F Fuerle","year":"2013","unstructured":"Fuerle F, Sienz J (2013) Decomposed surrogate based optimization of carbon-fiber bicycle frames using Optimum Latin Hypercubes for constrained design spaces. Comput Struct 119:48\u201359. https:\/\/doi.org\/10.1016\/j.compstruc.2012.11.014","journal-title":"Comput Struct"},{"key":"1769_CR37","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1080\/0305215X.2018.1542691","volume":"51","author":"Z Wu","year":"2019","unstructured":"Wu Z, Wang D, Wang W, Zhao K, Okolo PN, Zhang W (2019) Space-filling experimental designs for constrained design spaces. Eng Optim 51:1495\u20131508. https:\/\/doi.org\/10.1080\/0305215X.2018.1542691","journal-title":"Eng Optim"},{"key":"1769_CR38","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1080\/10618600.2018.1482760","volume":"28","author":"RB Chen","year":"2019","unstructured":"Chen RB, Li CH, Hung Y, Wang W (2019) Optimal noncollapsing space-filling designs for irregular experimental regions. J Comput Graph Stat 28:74\u201391. https:\/\/doi.org\/10.1080\/10618600.2018.1482760","journal-title":"J Comput Graph Stat"},{"key":"1769_CR39","doi-asserted-by":"crossref","unstructured":"Gendreau M, Potvin J-Y (2010) Handbook of metaheuristics: international series in operations research e management science","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"1769_CR40","unstructured":"Suganthan PN, Hansen N, Liang JJ, Deb K, Chen YP, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2006 special session on constrained real-parameter optimization, Tech. Report, Nanyang Technol. Univ. Singapore, May 2005 KanGAL Rep. 2005005, IIT Kanpur, India, pp\u00a01\u201324"},{"key":"1769_CR41","unstructured":"Yang L, Lai X, He X, Li P, Sun W, Song X A Newton-Cotes-based online acceleration signal fast processing approach to obtain displacement for digital twin (in press)"}],"container-title":["Engineering with Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00366-022-01769-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00366-022-01769-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00366-022-01769-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,26]],"date-time":"2023-09-26T00:11:15Z","timestamp":1695687075000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00366-022-01769-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,11]]},"references-count":41,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1769"],"URL":"https:\/\/doi.org\/10.1007\/s00366-022-01769-5","relation":{},"ISSN":["0177-0667","1435-5663"],"issn-type":[{"value":"0177-0667","type":"print"},{"value":"1435-5663","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,11]]},"assertion":[{"value":"18 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declared no potential conflicts of interest with respect to the research, authorship, and\/or publication of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}