{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T03:33:53Z","timestamp":1776569633808,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T00:00:00Z","timestamp":1624665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the Australian Research Council","award":["DP190103894"],"award-info":[{"award-number":["DP190103894"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,26]]},"DOI":"10.1145\/3449639.3459384","type":"proceedings-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T17:50:43Z","timestamp":1624297843000},"page":"600-608","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Entropy-based evolutionary diversity optimisation for the traveling salesperson problem"],"prefix":"10.1145","author":[{"given":"Adel","family":"Nikfarjam","sequence":"first","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakob","family":"Bossek","sequence":"additional","affiliation":[{"name":"University of M\u00fcnster, M\u00fcnster, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071342"},{"key":"e_1_3_2_1_2_1","volume-title":"Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Mathematical programming 97, 1","author":"Applegate David","year":"2003","unstructured":"David Applegate , Robert Bixby , Va\u0161ek Chv\u00e1tal , and William Cook . 2003. Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Mathematical programming 97, 1 ( 2003 ), 91--153. David Applegate, Robert Bixby, Va\u0161ek Chv\u00e1tal, and William Cook. 2003. Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Mathematical programming 97, 1 (2003), 91--153."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319619.3321894"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.2514\/1.I010219"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340307"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390181"},{"key":"e_1_3_2_1_7_1","volume-title":"Boyd and Lieven Vandenberghe","author":"Stephen","year":"2014","unstructured":"Stephen P. Boyd and Lieven Vandenberghe . 2014 . Convex Optimization. Cambridge University Press . Stephen P. Boyd and Lieven Vandenberghe. 2014. Convex Optimization. Cambridge University Press."},{"key":"e_1_3_2_1_8_1","first-page":"157","article-title":"V12. 1: User's Manual for CPLEX","volume":"46","author":"Cplex IBM ILOG","year":"2009","unstructured":"IBM ILOG Cplex . 2009 . V12. 1: User's Manual for CPLEX . International Business Machines Corporation 46 , 53 (2009), 157 . IBM ILOG Cplex. 2009. V12. 1: User's Manual for CPLEX. International Business Machines Corporation 46, 53 (2009), 157.","journal-title":"International Business Machines Corporation"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3389844"},{"key":"e_1_3_2_1_10_1","volume-title":"Smith","author":"Eiben Agoston E.","year":"2015","unstructured":"Agoston E. Eiben and James E . Smith . 2015 . Introduction to evolutionary computing. Springer . Agoston E. Eiben and James E. Smith. 2015. Introduction to evolutionary computing. Springer."},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of The Genetic and Evolutionary Computation Conference. ACM.","author":"Fontaine Matthew C.","unstructured":"Matthew C. Fontaine , Scott Lee , L. B. Soros , Fernando De Mesentier Silva , Julian Togelius , and Amy K. Hoover . 2019. Mapping Hearthstone Deck Spaces with Map-Elites with Sliding Boundaries . In Proceedings of The Genetic and Evolutionary Computation Conference. ACM. Matthew C. Fontaine, Scott Lee, L. B. Soros, Fernando De Mesentier Silva, Julian Togelius, and Amy K. Hoover. 2019. Mapping Hearthstone Deck Spaces with Map-Elites with Sliding Boundaries. In Proceedings of The Genetic and Evolutionary Computation Conference. ACM."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00274"},{"key":"e_1_3_2_1_13_1","volume-title":"Second Edition","author":"Ed Teofilo F.","year":"2018","unstructured":"Teofilo F. Gonzalez ( Ed .). 2018 . Handbook of Approximation Algorithms and Metaheuristics , Second Edition , Volume 1: Methologies and Traditional Applications. Chapman and Hall\/CRC. Teofilo F. Gonzalez (Ed.). 2018. Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications. Chapman and Hall\/CRC."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"e_1_3_2_1_15_1","volume-title":"An effective heuristic algorithm for the traveling-salesman problem. Operations research 21, 2","author":"Lin Shen","year":"1973","unstructured":"Shen Lin and Brian W Kernighan . 1973. An effective heuristic algorithm for the traveling-salesman problem. Operations research 21, 2 ( 1973 ), 498--516. Shen Lin and Brian W Kernighan. 1973. An effective heuristic algorithm for the traveling-salesman problem. Operations research 21, 2 (1973), 498--516."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/321043.321046"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Jean-Baptiste Mouret and Glenn Maguire. 2020. Quality Diversity for Multi-task Optimization. (2020).  Jean-Baptiste Mouret and Glenn Maguire. 2020. Quality Diversity for Multi-task Optimization. (2020).","DOI":"10.1145\/3377930.3390203"},{"key":"e_1_3_2_1_18_1","volume-title":"High-Order Entropy-based Population Diversity Measures in the Traveling Salesman Problem. Evolutionary Computation","author":"Nagata Yuichi","year":"2020","unstructured":"Yuichi Nagata . 2020. High-Order Entropy-based Population Diversity Measures in the Traveling Salesman Problem. Evolutionary Computation ( 2020 ), 1--25. Yuichi Nagata. 2020. High-Order Entropy-based Population Diversity Measures in the Traveling Salesman Problem. Evolutionary Computation (2020), 1--25."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1120.0506"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459385"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205532"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321796"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001665"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2550502"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TSMCB.2008.2006910","article-title":"Multiagent optimization system for solving the traveling salesman problem (TSP)","volume":"39","author":"Xie Xiao-Feng","year":"2008","unstructured":"Xiao-Feng Xie and Jiming Liu . 2008 . Multiagent optimization system for solving the traveling salesman problem (TSP) . IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 39 , 2 (2008), 489 -- 502 . Xiao-Feng Xie and Jiming Liu. 2008. Multiagent optimization system for solving the traveling salesman problem (TSP). IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 39, 2 (2008), 489--502.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30115-8_49"}],"event":{"name":"GECCO '21: Genetic and Evolutionary Computation Conference","location":"Lille France","acronym":"GECCO '21","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459384","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3449639.3459384","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:09Z","timestamp":1750195689000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459384"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,26]]},"references-count":27,"alternative-id":["10.1145\/3449639.3459384","10.1145\/3449639"],"URL":"https:\/\/doi.org\/10.1145\/3449639.3459384","relation":{},"subject":[],"published":{"date-parts":[[2021,6,26]]},"assertion":[{"value":"2021-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}