{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T09:31:15Z","timestamp":1790847075354,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"AFOSR","award":["FA9550-11-1-0088"],"award-info":[{"award-number":["FA9550-11-1-0088"]}]},{"name":"FAPESP","award":["2015\/06462-1"],"award-info":[{"award-number":["2015\/06462-1"]}]},{"name":"CNPq","award":["304400\/2014-9, 304400\/2014-9, 458598\/2014-3"],"award-info":[{"award-number":["304400\/2014-9, 304400\/2014-9, 458598\/2014-3"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1145\/3071178.3071305","type":"proceedings-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T17:59:28Z","timestamp":1498845568000},"page":"329-336","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Building a better heuristic for the traveling salesman problem"],"prefix":"10.1145","author":[{"given":"Danilo","family":"Sanches","sequence":"first","affiliation":[{"name":"Federal University of Technology of Paran\u00e1, Corn\u00e9lio Proc\u00f3pio, PR, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Darrell","family":"Whitley","sequence":"additional","affiliation":[{"name":"Colorado State University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Renato","family":"Tin\u00f3s","sequence":"additional","affiliation":[{"name":"University of S\u00e3o Paulo, Ribeir\u00e3o Preto, SP, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400841103"},{"key":"e_1_3_2_1_2_1","volume-title":"TSP test data","author":"Cook W.","year":"2013","unstructured":"W. Cook . TSP test data , 2013 . http:\/\/www.math.uwaterloo.ca\/tsp\/data\/index.html. Last Updated : September 2013. W. Cook. TSP test data, 2013. http:\/\/www.math.uwaterloo.ca\/tsp\/data\/index.html. Last Updated: September 2013."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32964-7_39"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.59.4667"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50349-3_11"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/978-3-540-30217-9_34","volume-title":"The EAX algorithm considering diversity loss. Parallel Problem Solving from Nature - PPSN","author":"Nagata Y.","year":"2004","unstructured":"Y. Nagata . The EAX algorithm considering diversity loss. Parallel Problem Solving from Nature - PPSN , pages 332 -- 341 , 2004 . Springer . Y. Nagata. The EAX algorithm considering diversity loss. Parallel Problem Solving from Nature - PPSN, pages 332--341, 2004. Springer."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11730095_15"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11844297_38"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA97)","author":"Nagata Y.","year":"1997","unstructured":"Y. Nagata and S. Kobayashi . Edge assembly crossover: A high-power genetic algorithm for the travelling salesman problem. In T. B\u00e4ck, editor , Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA97) , San Francisco, CA , 1997 . Morgan Kaufmann. Y. Nagata and S. Kobayashi. Edge assembly crossover: A high-power genetic algorithm for the travelling salesman problem. In T. B\u00e4ck, editor, Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA97), San Francisco, CA, 1997. Morgan Kaufmann."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1120.0506"},{"key":"e_1_3_2_1_12_1","first-page":"24","volume":"95","author":"Reinelt G.","year":"2016","unstructured":"G. Reinelt . TSPLIB 95 , accessed October 24 , 2016 . http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/. G. Reinelt. TSPLIB 95, accessed October 24, 2016. http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/.","journal-title":"TSPLIB"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908831"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725497"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598245"},{"key":"e_1_3_2_1_16_1","volume-title":"A new generalized partition crossover for the traveling salesman problem: tunneling between local optima. Submitted to Evolutionary Computation","author":"Tin\u00f3s R.","year":"2017","unstructured":"R. Tin\u00f3s , D. Whitley , and G. Ochoa . A new generalized partition crossover for the traveling salesman problem: tunneling between local optima. Submitted to Evolutionary Computation , 2017 . R. Tin\u00f3s, D. Whitley, and G. Ochoa. A new generalized partition crossover for the traveling salesman problem: tunneling between local optima. Submitted to Evolutionary Computation, 2017."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/645824.668596"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570026"}],"event":{"name":"GECCO '17: Genetic and Evolutionary Computation Conference","location":"Berlin Germany","acronym":"GECCO '17","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\/3071178.3071305","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3071178.3071305","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3071178.3071305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:05Z","timestamp":1750217405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3071178.3071305"}},"subtitle":["combining edge assembly crossover and partition crossover"],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":18,"alternative-id":["10.1145\/3071178.3071305","10.1145\/3071178"],"URL":"https:\/\/doi.org\/10.1145\/3071178.3071305","relation":{},"subject":[],"published":{"date-parts":[[2017,7]]},"assertion":[{"value":"2017-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}