{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T10:08:14Z","timestamp":1787652494591,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T00:00:00Z","timestamp":1562976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,13]]},"DOI":"10.1145\/3321707.3321772","type":"proceedings-article","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T13:48:04Z","timestamp":1562161684000},"page":"872-879","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["The massively parallel\n            <i>mixing genetic algorithm<\/i>\n            for the traveling salesman problem"],"prefix":"10.1145","author":[{"given":"Swetha","family":"Varadarajan","sequence":"first","affiliation":[{"name":"Computer Science, Colorado State University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Darrell","family":"Whitley","sequence":"additional","affiliation":[{"name":"Computer Science, Colorado State University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"8th DIMACS Implementation Challenge: The Traveling Salesman Problem. Accessed: 2019-02-02","author":"Challenge MACS","unstructured":"DI MACS Challenge . 2013. 8th DIMACS Implementation Challenge: The Traveling Salesman Problem. Accessed: 2019-02-02 . DIMACS Challenge. 2013. 8th DIMACS Implementation Challenge: The Traveling Salesman Problem. Accessed: 2019-02-02."},{"key":"e_1_3_2_1_2_1","unstructured":"W. Cook. 2011. In pursuit of the traveling salesman: mathematics at the limits of computation. Princeton Univ. Press.  W. Cook. 2011. In pursuit of the traveling salesman: mathematics at the limits of computation. Princeton Univ. Press."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598350"},{"key":"e_1_3_2_1_4_1","unstructured":"K. Helsgaun. 2014. DIMACS TSP Challenge Results: Current best tours found by LKH. http:\/\/www.akira.ruc.dk\/~keld\/research\/LKH\/DIMACS_results.html. Updated in October 6 2014.  K. Helsgaun. 2014. DIMACS TSP Challenge Results: Current best tours found by LKH. http:\/\/www.akira.ruc.dk\/~keld\/research\/LKH\/DIMACS_results.html. Updated in October 6 2014."},{"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","volume-title":"Proc. of the Seventh International Conference on Genetic Algorithms (ICGA97)","author":"Nagata Y.","unstructured":"Y. Nagata and S. Kobayashi . 1997. Edge Assembly Crossover: A high-power genetic algorithm for the travelling salesman problem . In Proc. of the Seventh International Conference on Genetic Algorithms (ICGA97) , Thomas B\u00e4ck (Ed.). Y. Nagata and S. Kobayashi. 1997. Edge Assembly Crossover: A high-power genetic algorithm for the travelling salesman problem. In Proc. of the Seventh International Conference on Genetic Algorithms (ICGA97), Thomas B\u00e4ck (Ed.)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1120.0506"},{"key":"e_1_3_2_1_8_1","volume-title":"Deconstructing the Big Valley Search Space Hypothesis. In European Conference on Evolutionary Computation in Combinatorial Optimization. 58--73","author":"Ochoa G.","unstructured":"G. Ochoa and N. Veerapen . 2016 . Deconstructing the Big Valley Search Space Hypothesis. In European Conference on Evolutionary Computation in Combinatorial Optimization. 58--73 . G. Ochoa and N. Veerapen. 2016. Deconstructing the Big Valley Search Space Hypothesis. In European Conference on Evolutionary Computation in Combinatorial Optimization. 58--73."},{"key":"e_1_3_2_1_9_1","unstructured":"D. Whitley R. Tin\u00f3s and G. Ochoa. 2019. A new generalized partition crossover for the traveling salesman problem: tunneling between local optima. Evolutionary Computation Journal In Press (2019).  D. Whitley R. Tin\u00f3s and G. Ochoa. 2019. A new generalized partition crossover for the traveling salesman problem: tunneling between local optima. Evolutionary Computation Journal In Press (2019)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"N.J. Radcliffe and P.D. Surry. 1995. Fitness Variance of Formae and Performance Predictions. In Foundations of Genetic Algorithms 3 D. Whitley and M. Vose (Eds.). Morgan Kaufmann 51--72.  N.J. Radcliffe and P.D. Surry. 1995. Fitness Variance of Formae and Performance Predictions. In Foundations of Genetic Algorithms 3 D. Whitley and M. Vose (Eds.). Morgan Kaufmann 51--72.","DOI":"10.1016\/B978-1-55860-356-1.50007-8"},{"key":"e_1_3_2_1_11_1","volume-title":"The Traveling Salesman: Computational Solutions for TSP Applications","unstructured":"Gerhard Reinelt. 1994. The Traveling Salesman: Computational Solutions for TSP Applications . Springer-Verlag, Berlin , Heidelberg . Gerhard Reinelt. 1994. The Traveling Salesman: Computational Solutions for TSP Applications. Springer-Verlag, Berlin, Heidelberg."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"J. Watson C. Ross V. Eisele Denton J. J Bins C. Guerra D Whitley and A. Howe. 1997. The traveling salesrep problem edge assembly crossover and 2-opt. In Parallell Problem Solving From Nature (PPSN)). Springer 823--832.   J. Watson C. Ross V. Eisele Denton J. J Bins C. Guerra D Whitley and A. Howe. 1997. The traveling salesrep problem edge assembly crossover and 2-opt. In Parallell Problem Solving From Nature (PPSN) ). Springer 823--832.","DOI":"10.1007\/BFb0056924"},{"key":"e_1_3_2_1_13_1","volume-title":"The Handbook of MetaHeuristics","author":"Whitley D.","unstructured":"D. Whitley . 2019. Next Generation Genetic Algorithms: A User's Guide and Tutorial . In The Handbook of MetaHeuristics . Springer , 245--274. D. Whitley. 2019. Next Generation Genetic Algorithms: A User's Guide and Tutorial. In The Handbook of MetaHeuristics. Springer, 245--274."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570026"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. of PPSN XI. Springer, 566--575","author":"Whitley D.","unstructured":"D. Whitley , D. Hains , and A. Howe . 2010. A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover . In Proc. of PPSN XI. Springer, 566--575 . D. Whitley, D. Hains, and A. Howe. 2010. A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover. In Proc. of PPSN XI. Springer, 566--575."}],"event":{"name":"GECCO '19: Genetic and Evolutionary Computation Conference","location":"Prague Czech Republic","acronym":"GECCO '19","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\/3321707.3321772","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3321707.3321772","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:19Z","timestamp":1750204399000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321772"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,13]]},"references-count":15,"alternative-id":["10.1145\/3321707.3321772","10.1145\/3321707"],"URL":"https:\/\/doi.org\/10.1145\/3321707.3321772","relation":{},"subject":[],"published":{"date-parts":[[2019,7,13]]},"assertion":[{"value":"2019-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}