{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T06:04:38Z","timestamp":1750831478371,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147135"},{"type":"electronic","value":"9783031147142"}],"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-14714-2_17","type":"book-chapter","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T21:03:13Z","timestamp":1660424593000},"page":"237-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Co-evolutionary Diversity Optimisation for\u00a0the\u00a0Traveling Thief Problem"],"prefix":"10.1007","author":[{"given":"Adel","family":"Nikfarjam","sequence":"first","affiliation":[]},{"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[]},{"given":"Jakob","family":"Bossek","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"17_CR1","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":"17_CR2","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":"17_CR3","unstructured":"Chagas, J.B.C., Wagner, M.: A weighted-sum method for solving the bi-objective traveling thief problem. CoRR abs\/2011.05081 (2020)"},{"key":"17_CR4","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":"17_CR5","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":"17_CR6","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":"17_CR7","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"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C.: Optimal parameter choices through self-adjustment: applying the 1\/5-th rule in discrete settings. In: GECCO Companion, pp. 1335\u20131342 (2015)","DOI":"10.1145\/2739480.2754684"},{"issue":"1","key":"17_CR9","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."},{"issue":"2","key":"17_CR10","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."},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/ijoc.1120.0506","volume":"25","author":"Y Nagata","year":"2013","unstructured":"Nagata, Y., Kobayashi, S.: A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem. INFORMS J. Comput. 25(2), 346\u2013363 (2013)","journal-title":"INFORMS J. Comput."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Neumann, A., Antipov, D., Neumann, F.: Coevolutionary Pareto diversity optimization. CoRR arXiv:2204.05457 (2022), accepted as full paper at GECCO 2022","DOI":"10.1145\/3512290.3528755"},{"key":"17_CR13","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":"17_CR14","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":"17_CR15","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":"17_CR16","doi-asserted-by":"crossref","unstructured":"Neumann, A., Szpak, Z.L., Chojnacki, W., Neumann, F.: Evolutionary image composition using feature covariance matrices. In: GECCO, pp. 817\u2013824 (2017)","DOI":"10.1145\/3071178.3071260"},{"key":"17_CR17","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":"17_CR18","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":"17_CR19","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":"17_CR20","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":"17_CR21","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":"17_CR22","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":"17_CR23","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"},{"issue":"1","key":"17_CR24","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":"17_CR25","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"}],"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-14714-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:42:42Z","timestamp":1710261762000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14714-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147135","9783031147142"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14714-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 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)"}}]}}