{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T18:41:20Z","timestamp":1729622480238,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/cec.2004.1331189","type":"proceedings-article","created":{"date-parts":[[2005,2,22]],"date-time":"2005-02-22T15:29:50Z","timestamp":1109086190000},"page":"2335-2340","source":"Crossref","is-referenced-by-count":0,"title":["A novel memetic algorithm with random multi-local-search: a case study of TSP"],"prefix":"10.1109","author":[{"family":"Peng Zou","sequence":"first","affiliation":[]},{"family":"Zhi Zhou","sequence":"additional","affiliation":[]},{"family":"Guoliang Chen","sequence":"additional","affiliation":[]},{"family":"Xin Yao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","first-page":"321","article-title":"Iterated local search approach using genetic transformation to the traveling salesman problem","volume":"1","author":"katayama","year":"1999","journal-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999"},{"key":"22","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1007\/BFb0056924","article-title":"The traveling salesrep problem, edge assembly crossover, and 2-opt","volume":"1498","author":"watson","year":"1998","journal-title":"Lecture Notes in Computer Science Parallel Problem Solving from Nature"},{"key":"17","first-page":"177","article-title":"A memetic approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimization on message-passing systems","author":"moscato","year":"1992","journal-title":"Parallel Computing and Transputer Applications"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"18","first-page":"133","article-title":"Scheduling problems and traveling salesman: The genetic edge recombination operator","author":"whitley","year":"1989","journal-title":"Proceedings of the 3rd International Conference on Genetic Algorithms"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1004429"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1038\/317804a0"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.804321"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"journal-title":"The Selfish Gene","year":"1976","author":"dawkins","key":"14"},{"key":"11","first-page":"987","article-title":"A memetic algorithm with self-adaptive local search: TSP as a case study","author":"krasnogor","year":"2000","journal-title":"Proc GECCO-2000 Genetic and Evolutionary Computation Conf"},{"key":"12","first-page":"450","article-title":"Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem","author":"nagata","year":"1997","journal-title":"Genetic Algorithms Proceedings of the 6th International Conference"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1997.592288"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"3"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1996.542671"},{"key":"2","first-page":"219","article-title":"Memetic algorithms: A short introduction","author":"moscato","year":"1999","journal-title":"New Ideas in Optimization"},{"key":"1","article-title":"On evolution, search, optimization, genetic algorithms and martial arts: Toward memetic algorithms","volume":"790","author":"moscato","year":"1989","journal-title":"Tech Rep"},{"key":"10","first-page":"472","article-title":"A comparison of memetic recombination operators for the traveling salesman problem","author":"merz","year":"2002","journal-title":"GECCO 2002 Proceedings of the Genetic and Evolutionary Computation Conference"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009823419804"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125404"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1038\/sj.jors.2600405"},{"key":"4","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1007\/BFb0056918","article-title":"Memetic algorithms and the fitness landscape of the graph bi-partitioning problem","volume":"1498","author":"merz","year":"1998","journal-title":"Lecture Notes in Computer Science Parallel Problem Solving from Nature"},{"key":"9","first-page":"297","article-title":"Memetic algorithms for the traveling salesman problem","volume":"13","author":"merz","year":"2001","journal-title":"Complex Systems"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/4235.887234"}],"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\/01331189.pdf?arnumber=1331189","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T15:06:39Z","timestamp":1548687999000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1331189\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/cec.2004.1331189","relation":{},"subject":[]}}