{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T07:34:05Z","timestamp":1773214445872,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,10,23]],"date-time":"2012-10-23T00:00:00Z","timestamp":1350950400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s11222-012-9363-3","type":"journal-article","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T14:55:19Z","timestamp":1350917719000},"page":"663-676","source":"Crossref","is-referenced-by-count":67,"title":["Optimizing Latin hypercube designs by particle swarm"],"prefix":"10.1007","volume":"23","author":[{"given":"Ray-Bing","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dai-Ni","family":"Hsieh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Hung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weichung","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,23]]},"reference":[{"key":"9363_CR1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/SIS.2007.368035","volume-title":"IEEE Swarm Intelligence Symposium. SIS 2007","author":"D. Bratton","year":"2007","unstructured":"Bratton, D., Kennedy, J.: Defining a standard for particle swarm optimization. In: IEEE Swarm Intelligence Symposium. SIS 2007, pp. 120\u2013127. IEEE, Piscataway (2007)"},{"key":"9363_CR2","first-page":"1","volume-title":"AIAA 2004-2011","author":"S.J. Bates","year":"2004","unstructured":"Bates, S.J., Sienz, J., Toropov, V.V.: Formulation of the optimal Latin hypercube design of experiments using a permutation genetic algorithm. In: AIAA 2004-2011, pp. 1\u20137 (2004)"},{"key":"9363_CR3","volume-title":"Fundamentals of Computational Swarm Intelligence","author":"A.P. Engelbrecht","year":"2006","unstructured":"Engelbrecht, A.P.: Fundamentals of Computational Swarm Intelligence. Wiley, Hoboken (2006)"},{"key":"9363_CR4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0025-5718-00-01281-3","volume":"71","author":"K.-T. Fang","year":"2002","unstructured":"Fang, K.-T., Ma, C.-X., Winker, P.: Centered L2-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs. Math. Comput. 71, 275\u2013296 (2002)","journal-title":"Math. Comput."},{"issue":"2","key":"9363_CR5","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1016\/j.ejor.2008.07.028","volume":"197","author":"A. Grosso","year":"2009","unstructured":"Grosso, A., Jamali, A.R.M.J.U., Locatelli, M.: Finding maximin Latin hypercube designs by iterated local search heuristics. Eur. J. Oper. Res. 197(2), 541\u2013547 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9363_CR6","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1080\/10556788.2010.509435","volume":"27","author":"Y. Hung","year":"2012","unstructured":"Hung, Y., Wang, W.: Accelerating parallel particle swarm optimization via GPU. Optim. Methods Softw. 27(1), 33\u201351 (2012)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"9363_CR7","doi-asserted-by":"crossref","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.: An efficient algorithm for constructing optimal design of computer experiments. J. Stat. Plan. Inference 134(1), 268\u2013287 (2005)","journal-title":"J. Stat. Plan. Inference"},{"key":"9363_CR8","first-page":"171","volume":"18","author":"V.R. Joseph","year":"2008","unstructured":"Joseph, V.R., Hung, Y.: Orthogonal-maximin Latin hypercube designs. Stat. Sin. 18, 171\u2013186 (2008)","journal-title":"Stat. Sin."},{"key":"9363_CR9","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","volume-title":"Proceedings of IEEE International Conference on Neural Networks","author":"J. Kennedy","year":"1995","unstructured":"Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol.\u00a04, pp. 1942\u20131948. IEEE, Piscataway (1995)"},{"key":"9363_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/biomet\/87.1.1","volume":"87","author":"M. Kennedy","year":"2000","unstructured":"Kennedy, M., O\u2019Hagan, A.: Predicting the output from a complex computer code when fast approximations are available. Biometrika 87, 1\u201313 (2000)","journal-title":"Biometrika"},{"issue":"9","key":"9363_CR11","doi-asserted-by":"crossref","first-page":"3231","DOI":"10.1016\/j.jspi.2005.01.007","volume":"136","author":"M. Liefvendahl","year":"2006","unstructured":"Liefvendahl, M., Stocki, R.: A study on algorithms for optimization of Latin hypercubes. J. Stat. Plan. Inference 136(9), 3231\u20133247 (2006)","journal-title":"J. Stat. Plan. Inference"},{"issue":"3","key":"9363_CR12","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/0378-3758(94)00035-T","volume":"43","author":"M.D. Morris","year":"1995","unstructured":"Morris, M.D., Mitchell, T.J.: Exploratory designs for computational experiments. J. Stat. Plan. Inference 43(3), 381\u2013402 (1995)","journal-title":"J. Stat. Plan. Inference"},{"key":"9363_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3799-8","volume-title":"The Design and Analysis of Computer Experiments","author":"T.J. Santner","year":"2003","unstructured":"Santner, T.J., Williams, B.J., Notz, W.I.: The Design and Analysis of Computer Experiments. Springer, New York (2003)"},{"issue":"424","key":"9363_CR14","doi-asserted-by":"crossref","first-page":"1392","DOI":"10.1080\/01621459.1993.10476423","volume":"88","author":"B. Tang","year":"1993","unstructured":"Tang, B.: Orthogonal array-based Latin hypercubes. J. Am. Stat. Assoc. 88(424), 1392\u20131397 (1993)","journal-title":"J. Am. Stat. Assoc."},{"issue":"6","key":"9363_CR15","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1080\/0305215X.2010.508524","volume":"43","author":"D.J.J. Toala","year":"2011","unstructured":"Toala, D.J.J., Bressloff, N.W., Keanea, A.J., Holden, C.M.E.: The development of a hybridized particle swarm for kriging hyperparameter tuning. Eng. Optim. 43(6), 675\u2013699 (2011)","journal-title":"Eng. Optim."},{"issue":"1","key":"9363_CR16","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1287\/opre.1060.0317","volume":"55","author":"E.R. Dam van","year":"2007","unstructured":"van Dam, E.R., Husslage, B., den Hertog, D., Melissen, H.: Maximin Latin hypercube designs in two dimensions. Oper. Res. 55(1), 158\u2013169 (2007)","journal-title":"Oper. Res."},{"issue":"3","key":"9363_CR17","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1287\/opre.1080.0604","volume":"57","author":"E.R. Dam van","year":"2009","unstructured":"van Dam, E.R., Rennen, G., Husslage, B.: Bounds for maximin Latin hypercube designs. Oper. Res. 57(3), 595\u2013608 (2009)","journal-title":"Oper. Res."},{"key":"9363_CR18","unstructured":"van den Bergh, F.: An analysis of particle swarm optimizers. Ph.D. Thesis, University of Pretoria (2006)"},{"key":"9363_CR19","first-page":"3","volume-title":"IEEE International Conference on Systems, Man and Cybernetics","author":"F. Bergh van\u00a0den","year":"2002","unstructured":"van\u00a0den Bergh, F., Engelbrecht, A.P.: A new locally convergent particle swarm optimiser. In: IEEE International Conference on Systems, Man and Cybernetics, p. 3 (2002)"},{"issue":"2","key":"9363_CR20","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/nme.2750","volume":"82","author":"F.A.C. Viana","year":"2010","unstructured":"Viana, F.A.C., Venter, G., Balabanov, V.: An algorithm for fast optimal Latin hypercube design of experiments. Int. J. Numer. Methods Eng. 82(2), 135\u2013156 (2010)","journal-title":"Int. J. Numer. Methods Eng."},{"issue":"1","key":"9363_CR21","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0378-3758(00)00105-1","volume":"90","author":"K.Q. Ye","year":"2000","unstructured":"Ye, K.Q., Li, W., Sudjianto, A.: Algorithmic construction of optimal symmetric Latin hypercube designs. J. Stat. Plan. Inference 90(1), 145\u2013159 (2000)","journal-title":"J. Stat. Plan. Inference"}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-012-9363-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11222-012-9363-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-012-9363-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,15]],"date-time":"2020-07-15T00:57:28Z","timestamp":1594774648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11222-012-9363-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,23]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["9363"],"URL":"https:\/\/doi.org\/10.1007\/s11222-012-9363-3","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,23]]}}}