{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T03:09:53Z","timestamp":1768100993527,"version":"3.49.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031147203","type":"print"},{"value":"9783031147210","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14721-0_29","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"413-427","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Analysis of\u00a0Quality Diversity Algorithms for\u00a0the\u00a0Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Adel","family":"Nikfarjam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anh","family":"Viet Do","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Alexander, B., Kortman, J., Neumann, A.: Evolution of artistic image variants through feature based diversity optimisation. In: GECCO, pp. 171\u2013178. ACM (2017)","DOI":"10.1145\/3071178.3071342"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Bossek, J., Neumann, A., Neumann, F.: Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms. In: GECCO, pp. 556\u2013564. ACM (2021)","DOI":"10.1145\/3449639.3459364"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Bossek, J., Neumann, F.: Evolutionary diversity optimization and the minimum spanning tree problem. In: GECCO, pp. 198\u2013206. ACM (2021)","DOI":"10.1145\/3449639.3459363"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Bossek, J., Neumann, F.: Exploring the feature space of TSP instances using quality diversity. CoRR abs\/2202.02077 (2022)","DOI":"10.1145\/3512290.3528851"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Clune, J., Mouret, J., Lipson, H.: Summary of \u201cthe evolutionary origins of modularity\u201d. In: GECCO (Companion), pp. 23\u201324. ACM (2013)","DOI":"10.1145\/2464576.2464596"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Cully, A., Mouret, J.: Behavioral repertoire learning in robotics. In: GECCO, pp. 175\u2013182. ACM (2013)","DOI":"10.1145\/2463372.2463399"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Do, A.V., Bossek, J., Neumann, A., Neumann, F.: Evolving diverse sets of tours for the travelling salesperson problem. In: GECCO, pp. 681\u2013689. ACM (2020)","DOI":"10.1145\/3377930.3389844"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Do, A.V., Guo, M., Neumann, A., Neumann, F.: Analysis of evolutionary diversity optimisation for permutation problems. In: GECCO, pp. 574\u2013582. ACM (2021)","DOI":"10.1145\/3449639.3459313"},{"issue":"43","key":"29_CR9","doi-asserted-by":"publisher","first-page":"6020","DOI":"10.1016\/j.tcs.2011.07.024","volume":"412","author":"B Doerr","year":"2011","unstructured":"Doerr, B., Eremeev, A.V., Neumann, F., Theile, M., Thyssen, C.: Evolutionary algorithms and dynamic programming. Theor. Comput. Sci. 412(43), 6020\u20136035 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Fontaine, M.C., et al.: Illuminating Mario scenes in the latent space of a generative adversarial network. In: AAAI, pp. 5922\u20135930. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i7.16740"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Fontaine, M.C., Togelius, J., Nikolaidis, S., Hoover, A.K.: Covariance matrix adaptation for the rapid illumination of behavior space. In: GECCO, pp. 94\u2013102. ACM (2020)","DOI":"10.1145\/3377930.3390232"},{"issue":"1","key":"29_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1162\/evco_a_00274","volume":"29","author":"W Gao","year":"2021","unstructured":"Gao, W., Nallaperuma, S., Neumann, F.: Feature-based diversity optimization for problem instance classification. Evol. Comput. 29(1), 107\u2013128 (2021)","journal-title":"Evol. Comput."},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Horoba, C.: Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem. In: FOGA, pp. 113\u2013120. ACM (2009)","DOI":"10.1145\/1527125.1527140"},{"issue":"2","key":"29_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1162\/EVCO_a_00025","volume":"19","author":"J Lehman","year":"2011","unstructured":"Lehman, J., Stanley, K.O.: Abandoning objectives: evolution through the search for novelty alone. Evol. Comput. 19(2), 189\u2013223 (2011)","journal-title":"Evol. Comput."},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Neumann, A., Bossek, J., Neumann, F.: Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions. In: GECCO, pp. 261\u2013269. ACM (2021)","DOI":"10.1145\/3449639.3459385"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Neumann, A., Gao, W., Doerr, C., Neumann, F., Wagner, M.: Discrepancy-based evolutionary diversity optimization. In: GECCO, pp. 991\u2013998. ACM (2018)","DOI":"10.1145\/3205455.3205532"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Neumann, A., Gao, W., Wagner, M., Neumann, F.: Evolutionary diversity optimization using multi-objective indicators. In: GECCO, pp. 837\u2013845. ACM (2019)","DOI":"10.1145\/3321707.3321796"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Nikfarjam, A., Bossek, J., Neumann, A., Neumann, F.: Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation. In: FOGA, pp. 9:1\u20139:11. ACM (2021)","DOI":"10.1145\/3450218.3477310"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Nikfarjam, A., Bossek, J., Neumann, A., Neumann, F.: Entropy-based evolutionary diversity optimisation for the traveling salesperson problem. In: GECCO, pp. 600\u2013608. ACM (2021)","DOI":"10.1145\/3449639.3459384"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Nikfarjam, A., Neumann, A., Neumann, F.: On the use of quality diversity algorithms for the traveling thief problem. CoRR abs\/2112.08627 (2021)","DOI":"10.1145\/3512290.3528752"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Nikfarjam, A., Neumann, A., Neumann, F.: Evolutionary diversity optimisation for the traveling thief problem. CoRR abs\/2204.02709 (2022)","DOI":"10.1145\/3512290.3528862"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Polyakovskiy, S., Bonyadi, M.R., Wagner, M., Michalewicz, Z., Neumann, F.: A comprehensive benchmark set and heuristics for the traveling thief problem. In: GECCO, pp. 477\u2013484. ACM (2014)","DOI":"10.1145\/2576768.2598249"},{"key":"29_CR23","doi-asserted-by":"publisher","first-page":"40","DOI":"10.3389\/frobt.2016.00040","volume":"3","author":"JK Pugh","year":"2016","unstructured":"Pugh, J.K., Soros, L.B., Stanley, K.O.: Quality diversity: a new frontier for evolutionary computation. Front. Robot. AI 3, 40 (2016)","journal-title":"Front. Robot. AI"},{"key":"29_CR24","doi-asserted-by":"crossref","unstructured":"Pugh, J.K., Soros, L.B., Szerlip, P.A., Stanley, K.O.: Confronting the challenge of quality diversity. In: GECCO, pp. 967\u2013974. ACM (2015)","DOI":"10.1145\/2739480.2754664"},{"key":"29_CR25","doi-asserted-by":"crossref","unstructured":"Rakicevic, N., Cully, A., Kormushev, P.: Policy manifold search: exploring the manifold hypothesis for diversity-based neuroevolution. In: GECCO, pp. 901\u2013909. ACM (2021)","DOI":"10.1145\/3449639.3459320"},{"key":"29_CR26","doi-asserted-by":"crossref","unstructured":"Steckel, K., Schrum, J.: Illuminating the space of beatable lode runner levels produced by various generative adversarial networks. In: GECCO Companion, pp. 111\u2013112. ACM (2021)","DOI":"10.1145\/3449726.3459440"},{"key":"29_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-01009-5_13","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"M Theile","year":"2009","unstructured":"Theile, M.: Exact solutions to the traveling salesperson problem by a population-based evolutionary algorithm. In: Cotta, C., Cowling, P. (eds.) EvoCOP 2009. LNCS, vol. 5482, pp. 145\u2013155. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01009-5_13"},{"issue":"1","key":"29_CR28","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF02243880","volume":"25","author":"P Toth","year":"1980","unstructured":"Toth, P.: Dynamic programming algorithms for the zero-one knapsack problem. Computing 25(1), 29\u201345 (1980)","journal-title":"Computing"},{"key":"29_CR29","doi-asserted-by":"crossref","unstructured":"Ulrich, T., Thiele, L.: Maximizing population diversity in single-objective optimization. In: GECCO, pp. 641\u2013648. ACM (2011)","DOI":"10.1145\/2001576.2001665"},{"key":"29_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/978-3-662-04565-7"},{"key":"29_CR31","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: GECCO, pp. 189\u2013197. ACM (2021)","DOI":"10.1145\/3449639.3459311"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14721-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:02:01Z","timestamp":1710259321000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 August 2022","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":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"185","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":"85","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":"46% - 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.75","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":"3.11","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)"}}]}}