{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:49:46Z","timestamp":1761896986675,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030125974"},{"type":"electronic","value":"9783030125981"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-12598-1_21","type":"book-chapter","created":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T14:41:50Z","timestamp":1549118510000},"page":"254-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Parallel Tabu Search Heuristic to Approximate Uniform Designs for Reference Set Based MOEAs"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Rodr\u00edguez S\u00e1nchez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonin","family":"Ponsich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio L\u00f3pez","family":"Jaimes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sa\u00fal Zapotecas","family":"Mart\u00ednez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,3]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470907443","volume-title":"Experiments with Mixtures: Designs, Models, and the Analysis of Mixture Data","author":"JA Cornell","year":"2011","unstructured":"Cornell, J.A.: Experiments with Mixtures: Designs, Models, and the Analysis of Mixture Data, vol. 403. Wiley, Hoboken (2011)"},{"issue":"3","key":"21_CR2","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1137\/S1052623496307510","volume":"8","author":"I Das","year":"1998","unstructured":"Das, I., Dennis, J.E.: Normal-boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM J. Optim. 8(3), 631\u2013657 (1998). https:\/\/doi.org\/10.1137\/S1052623496307510","journal-title":"SIAM J. Optim."},{"issue":"4","key":"21_CR3","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part i: solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577\u2013601 (2014). https:\/\/doi.org\/10.1109\/TEVC.2013.2281535","journal-title":"IEEE Trans. Evol. Comput."},{"key":"21_CR4","first-page":"363","volume":"3","author":"KT Fang","year":"1980","unstructured":"Fang, K.T.: Uniform design: application of number-theoretic methods in experimental design. Acta Math. Appl. Sin. 3, 363\u2013372 (1980)","journal-title":"Acta Math. Appl. Sin."},{"issue":"2","key":"21_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0167-7152(02)00357-7","volume":"61","author":"KT Fang","year":"2003","unstructured":"Fang, K.T., Qin, H.: A note on construction of nearly uniform designs with large number of runs. Stat. Prob. Lett. 61(2), 215\u2013224 (2003)","journal-title":"Stat. Prob. Lett."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Fang, K., Lin, D.: J. Uniform designs and their application in industry. In: Handbook on Statistics in Industry, pp. 131\u2013170. Elsevier, Amsterdam (2003)","DOI":"10.1016\/S0169-7161(03)22006-X"},{"issue":"5","key":"21_CR7","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533\u2013549 (1986). https:\/\/doi.org\/10.1016\/0305-0548(86)90048-1","journal-title":"Comput. Oper. Res."},{"key":"21_CR8","volume-title":"Applications of Number Theory to Numerical Analysis","author":"LK Hua","year":"2012","unstructured":"Hua, L.K., Wang, Y.: Applications of Number Theory to Numerical Analysis. Springer, Heidelberg (2012)"},{"issue":"1\u20133","key":"21_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1504\/IJMPT.2004.003916","volume":"20","author":"C Ma","year":"2004","unstructured":"Ma, C., Fang, K.T.: A new approach to construction of nearly uniform designs. Int. J. Mater. Product Technol. 20(1\u20133), 115\u2013126 (2004)","journal-title":"Int. J. Mater. Product Technol."},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1112\/S0025579300000644","volume":"2","author":"KF Roth","year":"1955","unstructured":"Roth, K.F.: Rational approximations to algebraic numbers. Mathematika 2(1), 1\u201320 (1955)","journal-title":"Mathematika"},{"issue":"2","key":"21_CR11","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1111\/j.2517-6161.1958.tb00299.x","volume":"20","author":"Henry Scheff\u00e9","year":"1958","unstructured":"Scheff\u00e9, H.: Experiments with mixtures. J. R. Stat. Soc. Ser. B (Methodol.) 344\u2013360 (1958)","journal-title":"Journal of the Royal Statistical Society: Series B (Methodological)"},{"issue":"6","key":"21_CR12","doi-asserted-by":"publisher","first-page":"1648","DOI":"10.1016\/j.cor.2012.01.001","volume":"40","author":"YY Tan","year":"2013","unstructured":"Tan, Y.Y., et al.: MOEA\/D+ uniform design: a new version of MOEA\/D for optimization problems with many objectives. Comput. Oper. Res. 40(6), 1648\u20131660 (2013)","journal-title":"Comput. Oper. Res."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-56046-0_10","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","author":"Y Wang","year":"2002","unstructured":"Wang, Y., Hickernell, F.J.: An historical overview of lattice point sets. In: Fang, K.T., Niederreiter, H., Hickernell, F.J. (eds.) Monte Carlo and Quasi-Monte Carlo Methods, pp. 158\u2013167. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-3-642-56046-0_10"},{"issue":"1","key":"21_CR14","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0378-3758(99)00089-0","volume":"83","author":"MY Xie","year":"2000","unstructured":"Xie, M.Y., Fang, K.T.: Admissibility and minimaxity of the uniform design measure in nonparametric regression model. J. Stat. Plan. Inference 83(1), 101\u2013111 (2000)","journal-title":"J. Stat. Plan. Inference"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Zapotecas-Mart\u00ednez, S., Aguirre, H.E., Tanaka, K., Coello Coello, C.A.: On the low-discrepancy sequences and their use in MOEA\/D for high-dimensional objective spaces. In: 2015 IEEE Congress on Evolutionary Computation (CEC), pp. 2835\u20132842. IEEE (2015)","DOI":"10.1109\/CEC.2015.7257241"},{"issue":"1","key":"21_CR16","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TEVC.2018.2836912","volume":"23","author":"Saul Zapotecas-Martinez","year":"2019","unstructured":"Zapotecas-Mart\u00ednez, S., Coello, C.A.C., Aguirre, H.E., Tanaka, K.: A review of features and limitations of existing scalable multi-objective test suites. IEEE Trans. Evol. Comput. 1 (2018). https:\/\/doi.org\/10.1109\/TEVC.2018.2836912","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.swevo.2018.05.004","volume":"44","author":"Sa\u00fal Zapotecas-Mart\u00ednez","year":"2019","unstructured":"Zapotecas-Mart\u00ednez, S., L\u00f3pez-Jaimes, A., Garc\u00eda-N\u00e1jera, A.: LIBEA: a Lebesgue indicator-based evolutionary algorithm for multi-objective optimization. Swarm Evol. Comput. (2018). https:\/\/doi.org\/10.1016\/j.swevo.2018.05.004, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S2210650217307216","journal-title":"Swarm and Evolutionary Computation"},{"issue":"6","key":"21_CR18","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007). https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Trans. Evol. Comput."},{"key":"21_CR19","unstructured":"Zhang, Q., et al.: Multiobjective optimization test instances for the CEC 2009 special session and competition. University of Essex, Colchester, UK and Nanyang technological University, Singapore, special session on performance assessment of multi-objective optimization algorithms, Technical report 264 (2008)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-12598-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T14:19:23Z","timestamp":1720966763000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-12598-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030125974","9783030125981"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-12598-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EMO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Evolutionary Multi-Criterion Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"East Lansing, MI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"emo2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.emo2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}