{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T07:46:32Z","timestamp":1759131992529},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":[[1991,5]]},"DOI":"10.1007\/bf00197287","type":"journal-article","created":{"date-parts":[[2004,8,28]],"date-time":"2004-08-28T15:01:02Z","timestamp":1093705262000},"page":"31-35","source":"Crossref","is-referenced-by-count":35,"title":["Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the Traveling Salesman Problem"],"prefix":"10.1007","volume":"65","author":[{"given":"B. K.","family":"Ambati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Ambati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. M.","family":"Mokhtar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF00197287_CR1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1017\/S0305004100034095","volume":"55","author":"J Beardwood","year":"1959","unstructured":"Beardwood J, et al. (1959) The shortest path through many points. Proc Cambridge Phil Soc 55:299\u2013327.","journal-title":"Proc Cambridge Phil Soc"},{"key":"BF00197287_CR2","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":"BF00197287_CR3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF00203032","volume":"63","author":"DB Fogel","year":"1990","unstructured":"Fogel DB, Atmar JW (1990) Comparing genetic operators with gaussian mutations in simulated evolutionary processes using linear systems. Biol Cybern 63:111\u2013114.","journal-title":"Biol Cybern"},{"key":"BF00197287_CR4","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":"BF00197287_CR5","first-page":"17","volume":"43","author":"B Ghosh","year":"1951","unstructured":"Ghosh B (1951) Random distances within a rectangle and between two rectangles. Bull Calcutta Math Soc 43:17\u201324.","journal-title":"Bull Calcutta Math Soc"},{"key":"BF00197287_CR6","unstructured":"Grefenstette J, et al. (1985) Genetic algorithms for the traveling salesman problem. In: Grefenstette J (ed) Proceedings of an international conference on genetic algorithms. Carnegie Mellon University, pp 160\u2013168."},{"key":"BF00197287_CR7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","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":"BF00197287_CR8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/moor.2.3.209","volume":"2","author":"RM Karp","year":"1977","unstructured":"Karp RM (1977) Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane. Math Oper Res 2:209\u2013224.","journal-title":"Math Oper Res"},{"key":"BF00197287_CR9","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":"BF00197287_CR10","volume-title":"Encyclopedia of mathematics and its applications","author":"LA Santalo","year":"1976","unstructured":"Santalo LA (1976) Integral geometry and geometric probability. Encyclopedia of mathematics and its applications. Addison-Wesley, New York."}],"container-title":["Biological Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00197287.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00197287\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00197287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T07:44:56Z","timestamp":1682754296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00197287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["BF00197287"],"URL":"https:\/\/doi.org\/10.1007\/bf00197287","relation":{},"ISSN":["0340-1200","1432-0770"],"issn-type":[{"value":"0340-1200","type":"print"},{"value":"1432-0770","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}