{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T14:02:10Z","timestamp":1780408930762,"version":"3.54.1"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031700705","type":"print"},{"value":"9783031700712","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-70071-2_12","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:54Z","timestamp":1725663774000},"page":"181-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Local Optima in\u00a0Diversity Optimization: Non-trivial Offspring Population is Essential"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7906-096X","authenticated-orcid":false,"given":"Denis","family":"Antipov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0036-4782","authenticated-orcid":false,"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2721-3618","authenticated-orcid":false,"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"issue":"6","key":"12_CR1","doi-asserted-by":"publisher","first-page":"1724","DOI":"10.1007\/s00453-022-00957-5","volume":"84","author":"D Antipov","year":"2022","unstructured":"Antipov, D., Buzdalov, M., Doerr, B.: Fast mutation in crossover-based algorithms. Algorithmica 84(6), 1724\u20131761 (2022)","journal-title":"Algorithmica"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Antipov, D., Neumann, A., Neumann, F.: Rigorous runtime analysis of diversity optimization with GSEMO on OneMinMax. In: Foundations of Genetic Algorithms, FOGA 2023, pp. 3\u201314. ACM (2023)","DOI":"10.1145\/3594805.3607135"},{"key":"12_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103644","volume":"303","author":"J Baste","year":"2022","unstructured":"Baste, J., et al.: Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory. Artif. Intell. 303, 103644 (2022)","journal-title":"Artif. Intell."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Benke, L., Miller, T., Papasimeon, M., Lipovetzky, N.: Diverse, top-k, and top-quality planning over simulators. In: ECAI. Frontiers in Artificial Intelligence and Applications, vol.\u00a0372, pp. 231\u2013238. IOS Press (2023)","DOI":"10.3233\/FAIA230275"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Bossek, J., Neumann, F.: Evolutionary diversity optimization and the minimum spanning tree problem. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 198\u2013206. ACM (2021)","DOI":"10.1145\/3449639.3459363"},{"key":"12_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.113719","volume":"951","author":"L Branson","year":"2023","unstructured":"Branson, L., Sutton, A.M.: Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs. Theor. Comput. Sci. 951, 113719 (2023)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1762","DOI":"10.1007\/s00453-021-00881-0","volume":"84","author":"M Buzdalov","year":"2022","unstructured":"Buzdalov, M., Doerr, B., Doerr, C., Vinokurov, D.: Fixed-target runtime analysis. Algorithmica 84(6), 1762\u20131793 (2022)","journal-title":"Algorithmica"},{"key":"12_CR8","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-030-66515-9_4","volume-title":"Black Box Optimization, Machine Learning, and No-Free Lunch Theorems","author":"K Chatzilygeroudis","year":"2021","unstructured":"Chatzilygeroudis, K., Cully, A., Vassiliades, V., Mouret, J.-B.: Quality-diversity optimization: a novel branch of stochastic optimization. In: Pardalos, P.M., Rasskazova, V., Vrahatis, M.N. (eds.) Black Box Optimization, Machine Learning, and No-Free Lunch Theorems. SOIA, vol. 170, pp. 109\u2013135. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-66515-9_4"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Cully, A., Mouret, J.: Behavioral repertoire learning in robotics. In: Genetic and Evolutionary Computation Conference, 2013, pp. 175\u2013182. ACM (2013)","DOI":"10.1145\/2463372.2463399"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Do, A.V., Guo, M., Neumann, A., Neumann, F.: Analysis of evolutionary diversity optimization for permutation problems. ACM Trans. Evol. Learn. Optim. 2(3), 11:1\u201311:27 (2022)","DOI":"10.1145\/3561974"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Do, A.V., Guo, M., Neumann, A., Neumann, F.: Diverse approximations for monotone submodular maximization problems with a matroid constraint. In: International Joint Conference on Artificial Intelligence, IJCAI 2023, pp. 5558\u20135566. ijcai.org (2023)","DOI":"10.24963\/ijcai.2023\/617"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Doerr, B., Gao, W., Neumann, F.: Runtime analysis of evolutionary diversity maximization for OneMinMax. In: Genetic and Evolutionary Computation Conference, GECCO 2016, pp. 557\u2013564. ACM (2016)","DOI":"10.1145\/2908812.2908827"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/evco.2009.17.1.3","volume":"17","author":"T Friedrich","year":"2009","unstructured":"Friedrich, T., He, J., Hebbinghaus, N., Neumann, F., Witt, C.: Analyses of simple hybrid algorithms for the vertex cover problem. Evol. Comput. 17(1), 3\u201319 (2009)","journal-title":"Evol. Comput."},{"issue":"4","key":"12_CR14","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1162\/EVCO_a_00003","volume":"18","author":"T Friedrich","year":"2010","unstructured":"Friedrich, T., He, J., Hebbinghaus, N., Neumann, F., Witt, C.: Approximating covering problems by randomized search heuristics using multi-objective models. Evol. Comput. 18(4), 617\u2013633 (2010)","journal-title":"Evol. Comput."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Gao, W., Neumann, F.: Runtime analysis for maximizing population diversity in single-objective optimization. In: Genetic and Evolutionary Computation Conference, GECCO 2014, pp. 777\u2013784. ACM (2014)","DOI":"10.1145\/2576768.2598251"},{"issue":"3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1162\/EVCO_a_00013","volume":"18","author":"O Giel","year":"2010","unstructured":"Giel, O., Lehre, P.K.: On the effect of populations in evolutionary multi-objective optimisation. Evol. Comput. 18(3), 335\u2013356 (2010)","journal-title":"Evol. Comput."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Gounder, S., Neumann, F., Neumann, A.: Evolutionary diversity optimisation for sparse directed communication networks. In: Genetic and Evolutionary Computation Conference, GECCO 2024. ACM (2024, to appear)","DOI":"10.1145\/3638529.3654184"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Gravina, D., Khalifa, A., Liapis, A., Togelius, J., Yannakakis, G.N.: Procedural content generation throuertegh quality diversity. In: IEEE Conference on Games, CoG 2019, pp.\u00a01\u20138. IEEE (2019)","DOI":"10.1109\/CIG.2019.8848053"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0377-2217(91)90293-5","volume":"54","author":"RW Haessler","year":"1991","unstructured":"Haessler, R.W., Sweeney, P.E.: Cutting stock problems and solution procedures. Eur. J. Oper. Res. 54, 141\u2013150 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Ingmar, L., de\u00a0la Banda, M.G., Stuckey, P.J., Tack, G.: Modelling diversity of solutions. In: AAAI Conference on Artificial Intelligence, AAAI 2020, pp. 1528\u20131535. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i02.5512"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Katz, M., Sohrabi, S.: Reshaping diverse planning. In: AAAI Conference on Artificial Intelligence, AAAI 2020, pp. 9892\u20139899. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i06.6543"},{"key":"12_CR22","unstructured":"Kellerhals, L., Renken, M., Zschoche, P.: Parameterized algorithms for diverse multistage problems. In: ESA. LIPIcs, vol.\u00a0204, pp. 55:1\u201355:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"issue":"4","key":"12_CR23","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1007\/s00453-012-9660-4","volume":"65","author":"S Kratsch","year":"2013","unstructured":"Kratsch, S., Neumann, F.: Fixed-parameter evolutionary algorithms and the vertex cover problem. Algorithmica 65(4), 754\u2013771 (2013)","journal-title":"Algorithmica"},{"key":"12_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-031-56992-0_17","volume-title":"EvoMUSART 2024","author":"J Macedo","year":"2024","unstructured":"Macedo, J., Lopes, D., Correia, J., Machado, P., Costa, E.: Evolving visually-diverse graphic design posters. In: Johnson, C., Rebelo, S.M., Santos, I. (eds.) EvoMUSART 2024. LNCS, vol. 14633, pp. 265\u2013278. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-56992-0_17"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Medina, A., Richey, M., Mueller, M., Schrum, J.: Evolving flying machines in minecraft using quality diversity. In: Genetic and Evolutionary Computation Conference, GECCO 2023, pp. 1418\u20131426 (2023)","DOI":"10.1145\/3583131.3590352"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Mkhatshwa, S., Nitschke, G.: The impact of morphological diversity in robot swarms. In: Genetic and Evolutionary Computation Conference, GECCO 2023, pp. 65\u201374 (2023)","DOI":"10.1145\/3583131.3590347"},{"key":"12_CR27","unstructured":"Mouret, J., Clune, J.: Illuminating search spaces by mapping elites. CoRR abs\/1504.04909 (2015)"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Neumann, A., Bossek, J., Neumann, F.: Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 261\u2013269. ACM (2021)","DOI":"10.1145\/3449639.3459385"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Neumann, A., et al.: Diversity optimization for the detection and concealment of spatially defined communication networks. In: Genetic and Evolutionary Computation Conference, GECCO 2023, pp. 1436\u20131444. ACM (2023)","DOI":"10.1145\/3583131.3590405"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Nikfarjam, A., Bossek, J., Neumann, A., Neumann, F.: Entropy-based evolutionary diversity optimisation for the traveling salesperson problem. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 600\u2013608. ACM (2021)","DOI":"10.1145\/3449639.3459384"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Nikfarjam, A., Neumann, A., Neumann, F.: Evolutionary diversity optimisation for the traveling thief problem. In: Genetic and Evolutionary Computation Conference, GECCO 2022, pp. 749\u2013756. ACM (2022)","DOI":"10.1145\/3512290.3528862"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Nikfarjam, A., Neumann, A., Neumann, F.: On the use of quality diversity algorithms for the traveling thief problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 260\u2013268 (2022)","DOI":"10.1145\/3512290.3528752"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"Nikfarjam, A., Rothenberger, R., Neumann, F., Friedrich, T.: Evolutionary diversity optimisation in constructing satisfying assignments. In: Genetic and Evolutionary Computation Conference, GECCO 2023, pp. 938\u2013945. ACM (2023)","DOI":"10.1145\/3583131.3590517"},{"key":"12_CR34","doi-asserted-by":"crossref","unstructured":"Nikfarjam, A., Stanford, T., Neumann, A., Dumuid, D., Neumann, F.: Quality diversity approaches for time use optimisation to improve health outcomes. In: Genetic and Evolutionary Computation Conference, GECCO 2024. ACM (2024, to appear)","DOI":"10.1145\/3638529.3654085"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Oliveto, P.S., He, J., Yao, X.: Evolutionary algorithms and the vertex cover problem. In: IEEE Congress on Evolutionary Computation, CEC 2007, pp. 1870\u20131877. IEEE (2007)","DOI":"10.1109\/CEC.2007.4424701"},{"key":"12_CR36","doi-asserted-by":"crossref","unstructured":"Oliveto, P.S., He, J., Yao, X.: Analysis of population-based evolutionary algorithms for the vertex cover problem. In: IEEE Congress on Evolutionary Computation, CEC 2008, pp. 1563\u20131570. IEEE (2008)","DOI":"10.1109\/CEC.2008.4631000"},{"key":"12_CR37","doi-asserted-by":"crossref","unstructured":"Pugh, J.K., Soros, L.B., Szerlip, P.A., Stanley, K.O.: Confronting the challenge of quality diversity. In: Genetic and Evolutionary Computation Conference, GECCO 2015, pp. 967\u2013974. ACM (2015)","DOI":"10.1145\/2739480.2754664"},{"key":"12_CR38","doi-asserted-by":"crossref","unstructured":"Ulrich, T., Thiele, L.: Maximizing population diversity in single-objective optimization. In: Genetic and Evolutionary Computation Conference, GECCO 2011, pp. 641\u2013648. ACM (2011)","DOI":"10.1145\/2001576.2001665"},{"key":"12_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1007\/3-540-45110-2_21","volume-title":"Genetic and Evolutionary Computation \u2014 GECCO 2003","author":"M Wineberg","year":"2003","unstructured":"Wineberg, M., Oppacher, F.: The underlying similarity of diversity measures used in evolutionary computation. In: Cant\u00fa-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 1493\u20131504. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45110-2_21"},{"key":"12_CR40","doi-asserted-by":"crossref","unstructured":"Zardini, E., Zappetti, D., Zambrano, D., Iacca, G., Floreano, D.: Seeking quality diversity in evolutionary co-design of morphology and control of soft tensegrity modular robots. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 189\u2013197. ACM (2021)","DOI":"10.1145\/3449639.3459311"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70071-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:53Z","timestamp":1725664253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70071-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700705","9783031700712"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70071-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}