{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T04:58:33Z","timestamp":1770958713504,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,2,2]],"date-time":"2016-02-02T00:00:00Z","timestamp":1454371200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s11222-016-9630-9","type":"journal-article","created":{"date-parts":[[2016,2,2]],"date-time":"2016-02-02T04:38:45Z","timestamp":1454387925000},"page":"423-437","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A hybrid elitist pareto-based coordinate exchange algorithm for constructing multi-criteria optimal experimental designs"],"prefix":"10.1007","volume":"27","author":[{"given":"Yongtao","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byran J.","family":"Smucker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timothy J.","family":"Robinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,2]]},"reference":[{"key":"9630_CR1","volume-title":"Hybrid Evolutionary Algorithms","author":"A Ajith","year":"2007","unstructured":"Ajith, A., Crina, G., Hisao, I.: Hybrid Evolutionary Algorithms. Springer, Berlin (2007)"},{"issue":"1","key":"9630_CR2","first-page":"65","volume":"1","author":"JJ Borkowski","year":"2003","unstructured":"Borkowski, J.J.: Using a genetic algorithm to generate small exact response surface designs. J. Probab. Stat. Sci. 1(1), 65\u201388 (2003)","journal-title":"J. Probab. Stat. Sci."},{"key":"9630_CR3","doi-asserted-by":"crossref","first-page":"1103","DOI":"10.1016\/j.jspi.2004.08.007","volume":"136","author":"D Bursztyn","year":"2006","unstructured":"Bursztyn, D., Steinberg, D.M.: Comparison of designs for computer experiments. J. Stat. Plan. Inference 136, 1103\u20131119 (2006)","journal-title":"J. Stat. Plan. Inference"},{"key":"9630_CR4","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.jspi.2014.12.004","volume":"160","author":"Y Cao","year":"2015","unstructured":"Cao, Y., Smucker, B.J., Robinson, T.J.: On using the hypervolume indicator to compare pareto fronts: applications to multi-criteria optimal experimental design. J. Stat. Plan. Inference 160, 60\u201374 (2015)","journal-title":"J. Stat. Plan. Inference"},{"issue":"3","key":"9630_CR5","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1080\/00401706.1980.10486162","volume":"22","author":"DR Cook","year":"1980","unstructured":"Cook, D.R., Nachtsheim, C.J.: A comparison of algorithms for constructing exact d-optimal designs. Technometrics 22(3), 315\u2013324 (1980)","journal-title":"Technometrics"},{"key":"9630_CR6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01197559","volume":"14","author":"I Das","year":"1997","unstructured":"Das, I., Dennis, J.E.: A closer look at drawbacks of minimizing weighted sums of objectives for pareto set generation in multicriteria optimization problems. Struct. Optim. 14, 63\u201369 (1997)","journal-title":"Struct. Optim."},{"key":"9630_CR7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1162\/evco.2010.18.1.18105","volume":"18","author":"A Elhossini","year":"2010","unstructured":"Elhossini, A., Areibi, S., Dony, R.: Strength pareto particle swarm optimization and hybrid ea-pso for multi-objective optimization. Evo. Comput. 18, 127\u2013156 (2010)","journal-title":"Evo. Comput."},{"key":"9630_CR8","unstructured":"Farrell, R.H., Kiefer, J., Walbran, A.: Optimum multivariate designs. In LM LeCam and J. Neyman (eds.), Proceedings of the fifth Berkeley symposium on mathematical statistics and probability. University of California Press 1, 113\u2013138 (1967)"},{"key":"9630_CR9","volume-title":"Theory of Optimal Experiments","author":"VV Fedorov","year":"1972","unstructured":"Fedorov, V.V.: Theory of Optimal Experiments. Elsevier Science, Philadelphia (1972)"},{"key":"9630_CR10","unstructured":"Gert van, V., Tommi, T.: \u201chit and run\u201d and \u201cshake and bake\u201d for sampling uniformly from convex shapes. R Package (2015)"},{"key":"9630_CR11","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1198\/TECH.2010.09113","volume":"53","author":"B Jones","year":"2011","unstructured":"Jones, B., Nachtsheim, C.J.: Efficient designs with minimal aliasing. Technometrics 53, 62\u201371 (2011)","journal-title":"Technometrics"},{"key":"9630_CR12","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1214\/aoms\/1177706252","volume":"30","author":"J Kiefer","year":"1959","unstructured":"Kiefer, J., Wolfowitz, J.: Optimum designs in regression problems. Ann. Math. Stat. 30, 271\u2013294 (1959)","journal-title":"Ann. Math. Stat."},{"key":"9630_CR13","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1111\/j.2517-6161.1959.tb00338.x","volume":"21","author":"J Kiefer","year":"1959","unstructured":"Kiefer, J.: Optimum experimental designs. J. R. Stat. Soc. Ser. B (Methodological) 21, 272\u2013319 (1959)","journal-title":"J. R. Stat. Soc. Ser. B (Methodological)"},{"key":"9630_CR14","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1214\/aoms\/1177705160","volume":"32","author":"J Kiefer","year":"1961","unstructured":"Kiefer, J.: Optimum designs in regression problems, ii. Ann. Math. Stat. 32, 298\u2013325 (1961)","journal-title":"Ann. Math. Stat."},{"issue":"7","key":"9630_CR15","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1002\/qre.1457","volume":"29","author":"W Limmun","year":"2013","unstructured":"Limmun, W., Borkowski, J.J., Chomtee, B.: Using a genetic algorithm to generate d-optimal designs for mixture experiments. Qual. Reliab. Eng. Int. 29(7), 1099\u20131638 (2013)","journal-title":"Qual. Reliab. Eng. Int."},{"issue":"4","key":"9630_CR16","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1198\/TECH.2011.10087","volume":"53","author":"L Lu","year":"2011","unstructured":"Lu, L., Anderson-Cook, C.M., Robinson, T.J.: Optimization of designed experiments based on multiple criteria utilizing a pareto frontier. Technometrics 53(4), 353\u2013365 (2011)","journal-title":"Technometrics"},{"key":"9630_CR17","first-page":"374","volume":"8","author":"WK Mashwani","year":"2011","unstructured":"Mashwani, W.K.: Hybrid multi-objective evolutionary algorithms: A survey of the state-of-the-art. Int. J. Comput. Sci. Issues 8, 374\u2013392 (2011)","journal-title":"Int. J. Comput. Sci. Issues"},{"issue":"1","key":"9630_CR18","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1080\/00401706.1995.10485889","volume":"37","author":"RK Meyer","year":"1995","unstructured":"Meyer, R.K., Nachtsheim, C.J.: The coordinate-exchange algorithm for constructing exact optimal experimental designs. Technometrics 37(1), 60\u201369 (1995)","journal-title":"Technometrics"},{"issue":"1","key":"9630_CR19","first-page":"195","volume":"16","author":"YJ Park","year":"2009","unstructured":"Park, Y.J.: Multi-optimal designs for second-order response surface models. Commun. Korean Stat. Soc. 16(1), 195\u2013208 (2009)","journal-title":"Commun. Korean Stat. Soc."},{"key":"9630_CR20","doi-asserted-by":"crossref","unstructured":"Sambo, F., Borrotti, M., Mylona, K.: A coordinate-exchange two-phase local search algorithm for the d- and i-optimal designs of split-plot experiments. Comput. Stat. Data Anal. 71, 1193\u20131207 (2014)","DOI":"10.1016\/j.csda.2013.03.015"},{"key":"9630_CR21","unstructured":"Scrucca, L.: R package \u2018ga\u2019 (2014)"},{"key":"9630_CR22","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1080\/00224065.2006.11918619","volume":"38","author":"CJ Sexton","year":"2006","unstructured":"Sexton, C.J., Anthony, D.K., Lewis, S.M., Please, C.P., Keane, A.J.: Design of experiment algorithms for assembled products. J. Qual. Technol. 38, 298\u2013308 (2006)","journal-title":"J. Qual. Technol."},{"key":"9630_CR23","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1109\/TEVC.2012.2204403","volume":"17","author":"K Sindhya","year":"2013","unstructured":"Sindhya, K., Miettinen, K., Deb, K.: A hybrid framework for evolutionary multi-objective optimization. Evol. Comput. IEEE Trans. 17, 495\u2013511 (2013)","journal-title":"Evol. Comput. IEEE Trans."},{"key":"9630_CR24","unstructured":"Smith, N.A., Tromble, R.W.: Sampling uniformly from the unit simplex. Johns Hopkins University, Technical Report, pp. 1\u20136 (2004)"},{"key":"9630_CR25","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1007\/11538356_66","volume-title":"Advances in Intelligent Computing","author":"L Wang","year":"2005","unstructured":"Wang, L., Wu, H., Tang, F., Zheng, D.Z.: A hybrid quantum-inspired genetic algorithm for flow shop scheduling. In: Huang, D.S., Zhang, X.P., Huang, G.B. (eds.) Advances in Intelligent Computing, pp. 636\u2013644. Springer, Heidelberg (2005)"},{"key":"9630_CR26","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. Evol. Comput. IEEE Trans. 1, 67\u201382 (1997)","journal-title":"Evol. Comput. IEEE Trans."},{"key":"9630_CR27","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1111\/j.1467-8640.2009.00332.x","volume":"25","author":"D Yang","year":"2009","unstructured":"Yang, D., Jiao, L., Gong, M.: Adaptive multi-objective optimization based on nondominated solutions. Comput. Intell. 25, 84\u2013108 (2009)","journal-title":"Comput. Intell."},{"key":"9630_CR28","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"A Zhou","year":"2011","unstructured":"Zhou, A., Qu, B.Y., Li, H., Zhao, S.Z., Suganthan, P.N., Zhang, Q.: Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol. Comput. 1, 32\u201349 (2011)","journal-title":"Swarm Evol. Comput."}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-016-9630-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11222-016-9630-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-016-9630-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-016-9630-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,14]],"date-time":"2024-06-14T03:13:20Z","timestamp":1718334800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11222-016-9630-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,2]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["9630"],"URL":"https:\/\/doi.org\/10.1007\/s11222-016-9630-9","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,2]]}}}