{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:20:49Z","timestamp":1757312449844,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/cec.2004.1331069","type":"proceedings-article","created":{"date-parts":[[2005,1,17]],"date-time":"2005-01-17T17:47:16Z","timestamp":1105984036000},"page":"1465-1472","source":"Crossref","is-referenced-by-count":6,"title":["Criteria for designing crossovers for TSP"],"prefix":"10.1109","author":[{"given":"Y.","family":"Nagata","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"3","first-page":"823","article-title":"The traveling salesrep problem, edge assembly crossover, and 2-opt","author":"watson","year":"2000","journal-title":"Proc of the Fifth Int Conf on Parallel Problem-solving from Nature"},{"key":"2","first-page":"133","article-title":"Scheduling problems and traveling salesman: The genetic edge recombination operator","author":"whitley","year":"1989","journal-title":"Proc of the 3rd Int Conf on Genetic Algorithms"},{"key":"10","first-page":"498","volume":"21","author":"lin","year":"1973","journal-title":"An Effective Heuristic Algorithm for the Traveling Salesman Problem Operations Research"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1996.542655"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1997.592288"},{"year":"0","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.1999.823285"},{"key":"4","first-page":"450","article-title":"Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem","author":"nagata","year":"1997","journal-title":"Proc 7th Int Conf Genetic Algorithms"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0032050"},{"key":"8","first-page":"321","article-title":"Iterated local search approach using genetic transformation to the traveling salesman problem","author":"katayama","year":"1999","journal-title":"Proc of GECCO"},{"key":"11","article-title":"The traveling salesman: Computational solutions for TSP applications","volume":"840","author":"reinelt","year":"1994","journal-title":"Lec Notes Comput Sci"},{"key":"12","first-page":"494","article-title":"Minimal generation gap model for GAs considering both exploration adn exploitation","author":"sato","year":"1996","journal-title":"Proc IIZUKA '96"}],"event":{"name":"2004 Congress on Evolutionary Computation","acronym":"CEC-04","location":"Portland, OR, USA"},"container-title":["Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9256\/29392\/01331069.pdf?arnumber=1331069","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T02:03:12Z","timestamp":1489456992000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1331069\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/cec.2004.1331069","relation":{},"subject":[]}}