{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:04:48Z","timestamp":1773655488624,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"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.3071304","type":"proceedings-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T17:59:28Z","timestamp":1498845568000},"page":"337-344","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Improving an exact solver for the traveling salesman problem using partition crossover"],"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":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darrell","family":"Whitley","sequence":"additional","affiliation":[{"name":"Colorado State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato","family":"Tin\u00f3s","sequence":"additional","affiliation":[{"name":"University of S\u00e3o Paulo, Ribeir\u00e3o Preto, SP, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","volume-title":"Applications of Evolutionary Computation: EvoApplications","author":"Ahammed F.","year":"2011","unstructured":"F. Ahammed and P. Moscato . Evolving l-systems as an intelligent design approach to find classes of difficult-to-solve traveling salesman problem instances . In Applications of Evolutionary Computation: EvoApplications , pages 1 -- 11 . Springer , 2011 . F. Ahammed and P. Moscato. Evolving l-systems as an intelligent design approach to find classes of difficult-to-solve traveling salesman problem instances. In Applications of Evolutionary Computation: EvoApplications, pages 1--11. Springer, 2011."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.1.82.15157"},{"key":"e_1_3_2_1_3_1","volume-title":"Concorde-03.12.19","author":"Applegate D. L.","year":"2003","unstructured":"D. L. Applegate , R. E. Bixby , V. Chvatal , and W. J. Cook . Concorde-03.12.19 , 2003 . http:\/\/www.math.uwaterloo.ca\/tsp\/data\/index.html. D. L. Applegate, R. E. Bixby, V. Chvatal, and W. J. Cook. Concorde-03.12.19, 2003. http:\/\/www.math.uwaterloo.ca\/tsp\/data\/index.html."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.3.233.16078"},{"key":"e_1_3_2_1_5_1","volume-title":"TSP test data, accessed","author":"Cook W.J.","year":"2016","unstructured":"W.J. Cook . TSP test data, accessed October 24, 2016 . http:\/\/www.math.uwaterloo.ca\/tsp\/data\/index.html. W.J. Cook. TSP test data, accessed October 24, 2016. http:\/\/www.math.uwaterloo.ca\/tsp\/data\/index.html."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32964-7_39"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-009-0004-6"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12340-0_23"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(92)90028-2"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.59.4667"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908820"},{"key":"e_1_3_2_1_13_1","first-page":"51","volume-title":"Foundations of Genetic Algorithms 3","author":"Radcliffe N.","year":"1995","unstructured":"N. Radcliffe and P. Surry . Fitness variance of formae and performance predictions . In D. Whitley and M. Vose, editors, Foundations of Genetic Algorithms 3 , pages 51 -- 72 . Morgan Kaufmann , 1995 . N. Radcliffe and P. Surry. Fitness variance of formae and performance predictions. In D. Whitley and M. Vose, editors, Foundations of Genetic Algorithms 3, pages 51--72. Morgan Kaufmann, 1995."},{"key":"e_1_3_2_1_14_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_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071305"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725497"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598245"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570026"},{"key":"e_1_3_2_1_19_1","first-page":"566","volume-title":"PPSN'10","author":"Whitley D.","year":"2010","unstructured":"D. Whitley , D. Hains , and A. Howe . A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover. In Parallel Problem Solving from Nature , PPSN'10 , pages 566 -- 575 , 2010 . Springer. D. Whitley, D. Hains, and A. Howe. A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover. In Parallel Problem Solving from Nature, PPSN'10, pages 566--575, 2010. Springer."}],"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.3071304","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3071178.3071304","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3071178.3071304","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.3071304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":19,"alternative-id":["10.1145\/3071178.3071304","10.1145\/3071178"],"URL":"https:\/\/doi.org\/10.1145\/3071178.3071304","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"}}]}}