{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T10:33:14Z","timestamp":1760524394073,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"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":"ANRT CIFRE Program"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,8]]},"DOI":"10.1145\/3512290.3528820","type":"proceedings-article","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T13:59:57Z","timestamp":1658152797000},"page":"476-483","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["An enhanced adaptive geometry evolutionary algorithm using stochastic diversity mechanism"],"prefix":"10.1145","author":[{"given":"Fodil","family":"Benali","sequence":"first","affiliation":[{"name":"Adwanted Group, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damien","family":"Bod\u00e9n\u00e8s","sequence":"additional","affiliation":[{"name":"Adwanted Group, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"De Runz","sequence":"additional","affiliation":[{"name":"University of Tours, Blois, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Labroche","sequence":"additional","affiliation":[{"name":"University of Tours, Blois, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78455-7_20"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/3016100.3016103"},{"key":"e_1_3_2_1_4_1","volume-title":"HypE: An algorithm for fast hypervolume-based many-objective optimization. Evolutionary computation 19, 1","author":"Bader Johannes","year":"2011","unstructured":"Johannes Bader and Eckart Zitzler . 2011. HypE: An algorithm for fast hypervolume-based many-objective optimization. Evolutionary computation 19, 1 ( 2011 ), 45--76. Johannes Bader and Eckart Zitzler. 2011. HypE: An algorithm for fast hypervolume-based many-objective optimization. Evolutionary computation 19, 1 (2011), 45--76."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.08.008"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2990567"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24694-7_71"},{"volume-title":"Practical nonparametric statistics","author":"Conover William Jay","key":"e_1_3_2_1_8_1","unstructured":"William Jay Conover . 1999. Practical nonparametric statistics . Vol. 350 . john wiley & sons. William Jay Conover. 1999. Practical nonparametric statistics. Vol. 350. john wiley & sons."},{"key":"e_1_3_2_1_9_1","series-title":"SIAM journal on optimization 8, 3","volume-title":"Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems","author":"Das Indraneel","year":"1998","unstructured":"Indraneel Das and John E Dennis . 1998. Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems . SIAM journal on optimization 8, 3 ( 1998 ), 631--657. Indraneel Das and John E Dennis. 1998. Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM journal on optimization 8, 3 (1998), 631--657."},{"volume-title":"Multi-objective evolutionary optimisation for product design and manufacturing","author":"Deb Kalyanmoy","key":"e_1_3_2_1_10_1","unstructured":"Kalyanmoy Deb . 2011. Multi-objective optimisation using evolutionary algorithms: an introduction . In Multi-objective evolutionary optimisation for product design and manufacturing . Springer , 3--34. Kalyanmoy Deb. 2011. Multi-objective optimisation using evolutionary algorithms: an introduction. In Multi-objective evolutionary optimisation for product design and manufacturing. Springer, 3--34."},{"key":"e_1_3_2_1_11_1","volume-title":"Ram Bhushan Agrawal, et al","author":"Deb Kalyanmoy","year":"1995","unstructured":"Kalyanmoy Deb , Ram Bhushan Agrawal, et al . 1995 . Simulated binary crossover for continuous search space. Complex systems 9, 2 (1995), 115--148. Kalyanmoy Deb, Ram Bhushan Agrawal, et al. 1995. Simulated binary crossover for continuous search space. Complex systems 9, 2 (1995), 115--148."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144113"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281535"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1007032"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"John E Dennis  Jr and Robert B Schnabel. 1996. Numerical methods for unconstrained optimization and nonlinear equations. SIAM.  John E Dennis Jr and Robert B Schnabel. 1996. Numerical methods for unconstrained optimization and nonlinear equations. SIAM.","DOI":"10.1137\/1.9781611971200"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(90)90297-O"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2865590"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2505784"},{"key":"e_1_3_2_1_20_1","volume-title":"ECAI","author":"Ishibuchi Hisao","year":"2020","unstructured":"Hisao Ishibuchi , Takashi Matsumoto , Naoki Masuyama , and Yusuke Nojima . 2020 . Many-objective problems are not always difficult for Pareto dominance-based evolutionary algorithms . In ECAI 2020. IOS Press, 291--298. Hisao Ishibuchi, Takashi Matsumoto, Naoki Masuyama, and Yusuke Nojima. 2020. Many-objective problems are not always difficult for Pareto dominance-based evolutionary algorithms. In ECAI 2020. IOS Press, 291--298."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389225"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321839"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1762545.1762552"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2791283"},{"volume-title":"Minkowski geometry","author":"Thompson Anthony C","key":"e_1_3_2_1_25_1","unstructured":"Anthony C Thompson and Anthony C Thompson . 1996. Minkowski geometry . Cambridge University Press . Anthony C Thompson and Anthony C Thompson. 1996. Minkowski geometry. Cambridge University Press."},{"volume-title":"Multiobjective evolutionary algorithms: classifications, analyses, and new innovations","author":"Van Veldhuizen David Allen","key":"e_1_3_2_1_26_1","unstructured":"David Allen Van Veldhuizen . 1999. Multiobjective evolutionary algorithms: classifications, analyses, and new innovations . Air Force Institute of Technology . David Allen Van Veldhuizen. 1999. Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. Air Force Institute of Technology."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2909636"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"e_1_3_2_1_29_1","volume-title":"Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach","author":"Zitzler Eckart","year":"1999","unstructured":"Eckart Zitzler and Lothar Thiele . 1999. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach . IEEE transactions on Evolutionary Computation 3, 4 ( 1999 ), 257--271. Eckart Zitzler and Lothar Thiele. 1999. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE transactions on Evolutionary Computation 3, 4 (1999), 257--271."}],"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.3528820","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3512290.3528820","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.3528820"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,8]]},"references-count":28,"alternative-id":["10.1145\/3512290.3528820","10.1145\/3512290"],"URL":"https:\/\/doi.org\/10.1145\/3512290.3528820","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"}}]}}