{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T02:59:42Z","timestamp":1709261982809},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Biol. Cybern."],"published-print":{"date-parts":[[1993,10]]},"DOI":"10.1007\/bf00199453","type":"journal-article","created":{"date-parts":[[2004,8,29]],"date-time":"2004-08-29T08:28:00Z","timestamp":1093768080000},"page":"539-546","source":"Crossref","is-referenced-by-count":0,"title":["Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation"],"prefix":"10.1007","volume":"69","author":[{"given":"K\u00e1roly F.","family":"P\u00e1l","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF00199453_CR1","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF00197287","volume":"65","author":"BK Ambati","year":"1991","unstructured":"Ambati BK et al. (1991) Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the travelling salesman problem. Biol Cybern 65:31\u201335","journal-title":"Biol Cybern"},{"key":"BF00199453_CR2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00203625","volume":"64","author":"W Banzhaf","year":"1990","unstructured":"Banzhaf W (1990) The \u201cmolecular\u201d traveling salesman. Biol Cybern 64:7\u201314","journal-title":"Biol Cybern"},{"key":"BF00199453_CR3","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/1026105","volume":"26","author":"E Bonomi","year":"1984","unstructured":"Bonomi E, Lutton J-L (1984) The N-city traveling salesman problem: statistical mechanics and the Metropolis algorithm. SIAM Rev 26:551\u2013568","journal-title":"SIAM Rev"},{"key":"BF00199453_CR4","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1038\/317804a0","volume":"317","author":"RM Brady","year":"1985","unstructured":"Brady RM (1985) Optimization strategies gleaned from biological evolution. Nature 317:804\u2013806","journal-title":"Nature"},{"key":"BF00199453_CR5","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","volume":"26","author":"H Crowder","year":"1980","unstructured":"Crowder H, Padberg MW (1980) Solving large-scale symmetric travelling salesman problems to optimality. Management Sci 26:495\u2013509","journal-title":"Management Sci"},{"key":"BF00199453_CR6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00202901","volume":"60","author":"DB Fogel","year":"1988","unstructured":"Fogel DB (1988) An evolutionary approach to the traveling salesman problem. Biol Cybern 60:139\u2013144","journal-title":"Biol Cybern"},{"key":"BF00199453_CR7","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"BF00199453_CR8","unstructured":"Grefenstette J et al. (1985) Genetic algorithms for the travelling salesman problem. In: Grefenstette J (ed) Proceedings of an international conference on genetic algorithms, Carnegie-Mellon University, pp 160\u2013169"},{"key":"BF00199453_CR9","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor"},{"key":"BF00199453_CR10","first-page":"141","volume":"52","author":"JJ Hopfield","year":"1985","unstructured":"Hopfield JJ, Tank DW (1985) Neural computation of decisions in optimization problems. Biol Cybern 52:141\u2013152","journal-title":"Biol Cybern"},{"key":"BF00199453_CR11","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S et al. (1983) Optimization by simulated annealing. Science 220:671\u2013680","journal-title":"Science"},{"key":"BF00199453_CR12","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin S (1965) Computer solutions for the travelling salesman problem. Bell Syst Tech J 44:2245\u20132269","journal-title":"Bell Syst Tech J"},{"key":"BF00199453_CR13","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling salesman problem. Oper Res 21:498\u2013516","journal-title":"Oper Res"},{"key":"BF00199453_CR14","volume-title":"Numerical recipes","author":"WH Press","year":"1986","unstructured":"Press WH et al. (1986) Numerical recipes. Cambridge University Press, Cambridge"}],"container-title":["Biological Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00199453.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00199453\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00199453","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T10:27:15Z","timestamp":1554287235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00199453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":14,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["BF00199453"],"URL":"https:\/\/doi.org\/10.1007\/bf00199453","relation":{},"ISSN":["0340-1200","1432-0770"],"issn-type":[{"value":"0340-1200","type":"print"},{"value":"1432-0770","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}