{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T02:50:14Z","timestamp":1768013414778,"version":"3.49.0"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2012,11,1]],"date-time":"2012-11-01T00:00:00Z","timestamp":1351728000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Comput. Simul."],"published-print":{"date-parts":[[2012,11]]},"abstract":"<jats:p>We present a new method for constructing nearly orthogonal Latin hypercubes that greatly expands their availability to experimenters. Latin hypercube designs have proven useful for exploring complex, high-dimensional computational models, but can be plagued with unacceptable correlations among input variables. To improve upon their effectiveness, many researchers have developed algorithms that generate orthogonal and nearly orthogonal Latin hypercubes. Unfortunately, these methodologies can have strict limitations on the feasible number of experimental runs and variables. To overcome these restrictions, we develop a mixed integer programming algorithm that generates Latin hypercubes with little or no correlation among their columns for most any determinate run-variable combination\u2014including fully saturated designs. Moreover, many designs can be constructed for a specified number of runs and factors\u2014thereby providing experimenters with a choice of several designs. In addition, our algorithm can be used to quickly adapt to changing experimental conditions by augmenting existing designs by adding new variables or generating new designs to accommodate a change in runs.<\/jats:p>","DOI":"10.1145\/2379810.2379813","type":"journal-article","created":{"date-parts":[[2012,11,20]],"date-time":"2012-11-20T15:50:20Z","timestamp":1353426620000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Constructing nearly orthogonal latin hypercubes for any nonsaturated run-variable combination"],"prefix":"10.1145","volume":"22","author":[{"given":"Alejandro S.","family":"Hernandez","sequence":"first","affiliation":[{"name":"United States Naval Postgraduate School"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas W.","family":"Lucas","sequence":"additional","affiliation":[{"name":"United States Naval Postgraduate School"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Carlyle","sequence":"additional","affiliation":[{"name":"United States Naval Postgraduate School"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,11,21]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Aarts E. and Lenstra J.K. 1997. Local Search in Combinatorial Optimization. Wiley. Aarts E. and Lenstra J.K. 1997. Local Search in Combinatorial Optimization. Wiley."},{"key":"e_1_2_1_2_1","unstructured":"Ang J. K. 2006. Extending orthogonal and nearly orthogonal Latin hypercube designs for computer simulation and experimentation. Master's thesis. Naval Postgraduate School Monterey CA. Ang J. K. 2006. Extending orthogonal and nearly orthogonal Latin hypercube designs for computer simulation and experimentation. Master's thesis. Naval Postgraduate School Monterey CA."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Barton R. R. 1998. Simulation metamodels In Proceedings of the Winter Simulation Conference. D. J. Medeiros E. F. Watson J. S. Carson and M. S. Manivannan Eds. vol 1 IEEE 167--174. Barton R. R. 1998. Simulation metamodels In Proceedings of the Winter Simulation Conference. D. J. Medeiros E. F. Watson J. S. Carson and M. S. Manivannan Eds. vol 1 IEEE 167--174.","DOI":"10.1109\/WSC.1998.744912"},{"key":"e_1_2_1_4_1","unstructured":"Bazaraa M. S. Jarvis J. J. and Sherali H. D. 2004. Linear Programming and Network Flows 4th Ed. Wiley. Bazaraa M. S. Jarvis J. J. and Sherali H. D. 2004. Linear Programming and Network Flows 4th Ed. Wiley."},{"key":"e_1_2_1_5_1","unstructured":"Bertsimas D. and Tsitsiklis J. N. 1997. Introduction to Linear Optimization. Athena Scientific Nashua NH. Bertsimas D. and Tsitsiklis J. N. 1997. Introduction to Linear Optimization. Athena Scientific Nashua NH."},{"key":"e_1_2_1_6_1","first-page":"69","article-title":"The peace support operations model: origins, development, philosophy and use","volume":"8","author":"Body H.","year":"2007","journal-title":"J. Defense Model. Simul. Appl. Methodol. Technol."},{"key":"e_1_2_1_7_1","unstructured":"Buyske S. and Trout R. 2001. Advanced Design of Experiments. Statistics 591 Lecture Series Rutgers University. Buyske S. and Trout R. 2001. Advanced Design of Experiments. Statistics 591 Lecture Series Rutgers University."},{"key":"e_1_2_1_8_1","unstructured":"Cioppa T. M. 2002. Efficient nearly orthogonal and space-filling experimental designs for high-dimensional complex models. Doctoral dissertation. Monterey CA: Naval Postgraduate School. Cioppa T. M. 2002. Efficient nearly orthogonal and space-filling experimental designs for high-dimensional complex models. Doctoral dissertation. Monterey CA: Naval Postgraduate School."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1198\/004017006000000453"},{"key":"e_1_2_1_10_1","unstructured":"Fang K. T. 2011. The uniform design. http:\/\/www.ath.hkbu.edu.hk\/UniformDesign\/. Fang K. T. 2011. The uniform design. http:\/\/www.ath.hkbu.edu.hk\/UniformDesign\/."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.2000.10486045"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-00-01281-3"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-00-01281-3"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0266-8920(92)90015-A"},{"key":"e_1_2_1_15_1","unstructured":"Hernandez A. S. 2008. Breaking barriers to design dimensions in nearly orthogonal Latin hypercubes. Doctoral dissertation. Naval Postgraduate School Monterey CA. Hernandez A. S. 2008. Breaking barriers to design dimensions in nearly orthogonal Latin hypercubes. Doctoral dissertation. Naval Postgraduate School Monterey CA."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-98-00894-1"},{"key":"e_1_2_1_17_1","unstructured":"Hillier F. S. and Lieberman G. J. 2005. Introduction to Operations Research. McGraw-Hill. Hillier F. S. and Lieberman G. J. 2005. Introduction to Operations Research. McGraw-Hill."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/03610918208812265"},{"key":"e_1_2_1_19_1","unstructured":"IBM. 2012. IBM ILOG Cplex Optimizer. http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/. IBM. 2012. IBM ILOG Cplex Optimizer. http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/."},{"key":"e_1_2_1_20_1","first-page":"171","article-title":"Orthogonal-maximin Latin hypercube designs","volume":"18","author":"Joseph V. R.","year":"2008","journal-title":"Statistica Sinica"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1198\/1061860032049"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1050.0136"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7161(96)13011-X"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00780-009-0095-y"},{"key":"e_1_2_1_25_1","unstructured":"Marlin B. 2009. Ascertaining validity in the abstract realm of PMESII simulation models: An analysis of the peace support operations model PSOM. Masters thesis. Naval Postgraduate School Monterey CA. Marlin B. 2009. Ascertaining validity in the abstract realm of PMESII simulation models: An analysis of the peace support operations model PSOM. Masters thesis. Naval Postgraduate School Monterey CA."},{"key":"e_1_2_1_26_1","first-page":"239","article-title":"A comparison of three methods for selecting values of input variables in the analysis of output from a computer code","volume":"21","author":"McKay M. D.","year":"1979","journal-title":"Technometrics"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1080\/15598608.2011.10412052"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(94)00035-T"},{"key":"e_1_2_1_29_1","unstructured":"Montgomery D. C. 2005. Design and Analysis of Experiments. Wiley. Montgomery D. C. 2005. Design and Analysis of Experiments. Wiley."},{"key":"e_1_2_1_30_1","article-title":"Controlling correlations in Latin hypercube samples","volume":"89","author":"Owen A. B.","year":"1994","journal-title":"J. Amer. Statist. Assoc. Theory Methods"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/272991.273010"},{"key":"e_1_2_1_32_1","first-page":"1721","article-title":"A construction method for orthogonal Latin hypercube designs with prime power levels","volume":"19","author":"Pang F.","year":"2009","journal-title":"Statistica Sinica"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1111\/j.2517-6161.1954.tb00156.x","article-title":"The errors of lattice sampling","volume":"16","author":"Patterson H. D.","year":"1954","journal-title":"J. Royal Statist. Soc. Series B Methodol."},{"key":"e_1_2_1_34_1","unstructured":"Rardin R. L. 1998. Optimization in Operations Research. Prentice Hall Inc. Rardin R. L. 1998. Optimization in Operations Research. Prentice Hall Inc."},{"key":"e_1_2_1_35_1","unstructured":"Sanchez S. M. 2012. NOLH designs spreadsheet and code. http:\/\/harvest.nps.edu. Sanchez S. M. 2012. NOLH designs spreadsheet and code. http:\/\/harvest.nps.edu."},{"key":"e_1_2_1_36_1","volume-title":"Special Designs and Applications","author":"Sanchez S. M.","year":"2012"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1113316.1113320"},{"key":"e_1_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Santner T. J. Williams B. J. and Notz W. 2003. The Design and Analysis of Computer Experiments. Springer. Santner T. J. Williams B. J. and Notz W. 2003. The Design and Analysis of Computer Experiments. Springer.","DOI":"10.1007\/978-1-4757-3799-8"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1198\/004017003000000168"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/93.2.279"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asp058"},{"key":"e_1_2_1_42_1","first-page":"965","article-title":"Selecting Latin hypercubes using correlation criteria","volume":"8","author":"Tang B.","year":"1998","journal-title":"Statisca Sinica"},{"key":"e_1_2_1_43_1","unstructured":"Wolsey L. A. 1998. Integer Programming. Wiley. Wolsey L. A. 1998. Integer Programming. Wiley."},{"key":"e_1_2_1_44_1","article-title":"Orthogonal column Latin hypercubes and their application in computer experiments","volume":"93","author":"Ye K. Q.","year":"1998","journal-title":"J. Amer. Statist. Assoc. Theory Methods"}],"container-title":["ACM Transactions on Modeling and Computer Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2379810.2379813","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2379810.2379813","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:33:58Z","timestamp":1750239238000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2379810.2379813"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["10.1145\/2379810.2379813"],"URL":"https:\/\/doi.org\/10.1145\/2379810.2379813","relation":{},"ISSN":["1049-3301","1558-1195"],"issn-type":[{"value":"1049-3301","type":"print"},{"value":"1558-1195","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11]]},"assertion":[{"value":"2011-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-11-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}