{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T06:44:32Z","timestamp":1706683472734},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,8,7]],"date-time":"2015-08-07T00:00:00Z","timestamp":1438905600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Artif Life Robotics"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10015-015-0220-2","type":"journal-article","created":{"date-parts":[[2015,8,6]],"date-time":"2015-08-06T11:27:46Z","timestamp":1438860466000},"page":"257-261","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Chases and escapes, and optimization problems"],"prefix":"10.1007","volume":"20","author":[{"given":"Toru","family":"Ohira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tadaaki","family":"Hosaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoaki","family":"Nogawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,7]]},"reference":[{"key":"220_CR1","volume-title":"Chases and escapes: the mathematics of pursuit and evasion","author":"PJ Nahin","year":"2007","unstructured":"Nahin PJ (2007) Chases and escapes: the mathematics of pursuit and evasion. Princeton University Press, Princeton"},{"key":"220_CR2","volume-title":"Differential games","author":"R Isaacs","year":"1965","unstructured":"Isaacs R (1965) Differential games. Wiley, New York"},{"key":"220_CR3","doi-asserted-by":"crossref","unstructured":"Rucle WH (1991) A discrete search game. In: Raghavan TES et al (eds) Stochastic games and related topics. Kulwer, New York, pp 29\u201343","DOI":"10.1007\/978-94-011-3760-7_4"},{"key":"220_CR4","doi-asserted-by":"crossref","first-page":"053013","DOI":"10.1088\/1367-2630\/12\/5\/053013","volume":"12","author":"A Kamimura","year":"2010","unstructured":"Kamimura A, Ohira T (2010) Group chase and escape. New J Phys 12:053013","journal-title":"New J Phys"},{"key":"220_CR5","volume-title":"In pursuit of the traveling salesman: mathematics at the limits of computation","author":"JW Cook","year":"2012","unstructured":"Cook JW (2012) In pursuit of the traveling salesman: mathematics at the limits of computation. Princeton University Press, Princeton"},{"key":"220_CR6","unstructured":"http:\/\/elib.zib.de\/pub\/Packages\/mp-testdata\/tsp\/tsplib\/tsp\/index.html (The following web site has a collection of Travelling Salesman Problem. We have used one with 52 cities, named in the list as berlin52.tsp and berlin52.opt.tour). Accessed 27 Nov 2014"},{"key":"220_CR7","doi-asserted-by":"crossref","first-page":"1792","DOI":"10.1103\/PhysRevLett.35.1792","volume":"35","author":"D Sherrington","year":"1975","unstructured":"Sherrington D, Kirkpatric S (1975) Solvable model of a spin-glass. Phys Rev Lett 35:1792\u20131796","journal-title":"Phys Rev Lett"},{"key":"220_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-6289-7","volume-title":"The Sherrington-Kirkpatric model","author":"D Panchenko","year":"2013","unstructured":"Panchenko D (2013) The Sherrington-Kirkpatric model. Springer, New York"},{"key":"220_CR9","doi-asserted-by":"crossref","first-page":"1356","DOI":"10.1103\/PhysRevLett.27.1356","volume":"27","author":"DC Mattis","year":"1971","unstructured":"Mattis DC (1971) Exactly solvable model of a magnetic impurity. Phys Rev Lett 27:1356\u20131357","journal-title":"Phys Rev Lett"},{"key":"220_CR10","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":"220_CR11","volume-title":"Genetic Algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic Algorithms in search, optimization and machine learning. Addison-Wesley, Boston"},{"key":"220_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3167-5","volume-title":"Neural Networks in optimization","author":"XS Zhang","year":"2000","unstructured":"Zhang XS (2000) Neural Networks in optimization. Springer, New York"}],"container-title":["Artificial Life and Robotics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10015-015-0220-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10015-015-0220-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10015-015-0220-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:36:13Z","timestamp":1559133373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10015-015-0220-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,7]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["220"],"URL":"https:\/\/doi.org\/10.1007\/s10015-015-0220-2","relation":{},"ISSN":["1433-5298","1614-7456"],"issn-type":[{"value":"1433-5298","type":"print"},{"value":"1614-7456","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,7]]}}}