{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:58:48Z","timestamp":1725548328716},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1109\/cec.2018.8477800","type":"proceedings-article","created":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T00:33:13Z","timestamp":1540254793000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["A Fusion Mechanism for the Generalized Asymmetric Partition Crossover"],"prefix":"10.1109","author":[{"given":"Renato","family":"Tinos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darrell","family":"Whitley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(03)00198-9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2008.01.003"},{"journal-title":"LKH","year":"2018","author":"helsgaun","key":"ref12"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/3-540-44808-X_3","article-title":"The asymmetric traveling salesman problem: algorithms, instance generators, and tests","author":"cirasella","year":"2001","journal-title":"Algorithm Engineering and Experimentation"},{"journal-title":"8th DIMACS Implementation Challenge The Traveling Salesman Problem","year":"2013","author":"johnson","key":"ref14"},{"key":"ref4","first-page":"501","article-title":"Generalized asymmetric partition crossover (GAPX) for the asymmetric TSP","author":"tin\u00f3s","year":"2014","journal-title":"Proc of GECCO'2014"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.59.4667"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45823-6_93"},{"key":"ref5","first-page":"341","article-title":"Genetic algorithm with optimal recombination for the asymmetric travelling salesman problem","author":"eremeev","year":"2017","journal-title":"Int Conf on Large-Scale Scientific Comp"},{"key":"ref8","first-page":"137","article-title":"Partition crossover for pseudo-boolean optimization","author":"tin\u00f3s","year":"2015","journal-title":"Proc of the 2015 ACM Conf on Foundations of Genetic Alg XIII"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2010.116"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"journal-title":"Pursuit of the Traveling Salesman Mathematics at the Limits of Computation","year":"2011","author":"cook","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.02.029"}],"event":{"name":"2018 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2018,7,8]]},"location":"Rio de Janeiro","end":{"date-parts":[[2018,7,13]]}},"container-title":["2018 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8466244\/8477640\/08477800.pdf?arnumber=8477800","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T06:04:02Z","timestamp":1598249042000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8477800\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/cec.2018.8477800","relation":{},"subject":[],"published":{"date-parts":[[2018,7]]}}}