{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:53Z","timestamp":1750220093022,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T00:00:00Z","timestamp":1657238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Bavarian Ministry of Economic Affairs","award":["IUK574"],"award-info":[{"award-number":["IUK574"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,8]]},"DOI":"10.1145\/3512290.3528872","type":"proceedings-article","created":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T15:32:35Z","timestamp":1660750355000},"page":"556-564","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Region of interest based non-dominated sorting genetic algorithm-II"],"prefix":"10.1145","author":[{"given":"Manu","family":"Manuel","sequence":"first","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}]},{"given":"Benjamin","family":"Hien","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}]},{"given":"Simon","family":"Conrady","sequence":"additional","affiliation":[{"name":"Arnold &amp; Richter Cine Technik, Munich, Germany"}]},{"given":"Arne","family":"Kreddig","sequence":"additional","affiliation":[{"name":"SmartRay GmbH, Wolfratshausen, Germany"}]},{"given":"Nguyen Anh Vu","family":"Doan","sequence":"additional","affiliation":[{"name":"TU Munich &amp; Fraunhofer IKS, Munich, Germany"}]},{"given":"Walter","family":"Stechele","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}]}],"member":"320","published-online":{"date-parts":[[2022,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2041060"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2990567"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88908-3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24694-7_71"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18965-4_10"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45356-3_83"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277116"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424735"},{"key":"e_1_3_2_1_9_1","volume-title":"In Proceedings of the World Congress on Computational Intelligence (WCCI-2006)","author":"Deb Kalyanmoy","year":"2006","unstructured":"Kalyanmoy Deb and Dhish Saxena . 2006 . Searching for Pareto-optimal solutions through dimensionality reduction for certain large-dimensional multi-objective optimization problems . In In Proceedings of the World Congress on Computational Intelligence (WCCI-2006) . IEEE, Vancouver, Canada, 3352--3360. Kalyanmoy Deb and Dhish Saxena. 2006. Searching for Pareto-optimal solutions through dimensionality reduction for certain large-dimensional multi-objective optimization problems. In In Proceedings of the World Congress on Computational Intelligence (WCCI-2006). IEEE, Vancouver, Canada, 3352--3360."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144112"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.3929\/ethz-a-004284199"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42978-6_1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2011.5949963"},{"key":"e_1_3_2_1_14_1","first-page":"33","article-title":"Synchronous R-NSGA-II","volume":"26","author":"Filatovas Ernestas","year":"2015","unstructured":"Ernestas Filatovas , Olga Kurasova , and Karthik Sindhya . 2015 . Synchronous R-NSGA-II : An Extended Preference-Based Evolutionary Algorithm for Multi-Objective Optimization. Informatica 26 , 1 (2015), 33 -- 50 . http:\/\/content.iospress.com\/articles\/informatica\/inf1049 Ernestas Filatovas, Olga Kurasova, and Karthik Sindhya. 2015. Synchronous R-NSGA-II: An Extended Preference-Based Evolutionary Algorithm for Multi-Objective Optimization. Informatica 26, 1 (2015), 33--50. http:\/\/content.iospress.com\/articles\/informatica\/inf1049","journal-title":"An Extended Preference-Based Evolutionary Algorithm for Multi-Objective Optimization. Informatica"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10100-016-0443-x"},{"volume-title":"Proceedings of the 5th International Conference on Genetic Algorithms. Morgan Kaufmann Publishers Inc.","author":"Carlos","key":"e_1_3_2_1_16_1","unstructured":"Carlos M. Fonseca and Peter J. Fleming. 1993. Genetic Algorithms for Multiobjective Optimization: Formulation Discussion and Generalization . In Proceedings of the 5th International Conference on Genetic Algorithms. Morgan Kaufmann Publishers Inc. , San Francisco, CA, USA, 416--423. Carlos M. Fonseca and Peter J. Fleming. 1993. Genetic Algorithms for Multiobjective Optimization: Formulation Discussion and Generalization. In Proceedings of the 5th International Conference on Genetic Algorithms. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 416--423."},{"key":"e_1_3_2_1_17_1","volume-title":"Marc-Andr\u00e9 Gardner, Marc Parizeau, and Christian Gagn\u00e9.","author":"Fortin F\u00e9lix-Antoine","year":"2012","unstructured":"F\u00e9lix-Antoine Fortin , Fran\u00e7ois-Michel De Rainville , Marc-Andr\u00e9 Gardner, Marc Parizeau, and Christian Gagn\u00e9. 2012 . DEAP : Evolutionary Algorithms Made Easy. Journal of Machine Learning Research 13 (jul 2012), 2171--2175. F\u00e9lix-Antoine Fortin, Fran\u00e7ois-Michel De Rainville, Marc-Andr\u00e9 Gardner, Marc Parizeau, and Christian Gagn\u00e9. 2012. DEAP: Evolutionary Algorithms Made Easy. Journal of Machine Learning Research 13 (jul 2012), 2171--2175."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2021.1003817"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.2987559"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2017.7969463"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/NorCAS51424.2020.9265138"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.15803\/ijnc.11.2_438"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5563-6_1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.07.015"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1994.2.3.221"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2009.17.3.411"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3470971"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI.2018.8628819"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568202"}],"event":{"name":"GECCO '22: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Boston Massachusetts","acronym":"GECCO '22"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512290.3528872","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3512290.3528872","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:57Z","timestamp":1750183797000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512290.3528872"}},"subtitle":["an invite and conquer approach"],"short-title":[],"issued":{"date-parts":[[2022,7,8]]},"references-count":30,"alternative-id":["10.1145\/3512290.3528872","10.1145\/3512290"],"URL":"https:\/\/doi.org\/10.1145\/3512290.3528872","relation":{},"subject":[],"published":{"date-parts":[[2022,7,8]]},"assertion":[{"value":"2022-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}