{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T06:27:26Z","timestamp":1767421646970,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042768"},{"type":"electronic","value":"9783642042775"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04277-5_57","type":"book-chapter","created":{"date-parts":[[2009,10,1]],"date-time":"2009-10-01T08:49:52Z","timestamp":1254386992000},"page":"563-572","source":"Crossref","is-referenced-by-count":8,"title":["The Lin-Kernighan Algorithm Driven by Chaotic Neurodynamics for Large Scale Traveling Salesman Problems"],"prefix":"10.1007","author":[{"given":"Shun","family":"Motohashi","sequence":"first","affiliation":[]},{"given":"Takafumi","family":"Matsuura","sequence":"additional","affiliation":[]},{"given":"Tohru","family":"Ikeguchi","sequence":"additional","affiliation":[]},{"given":"Kazuyuki","family":"Aihara","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"57_CR1","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling-salesman problem. Operations Research\u00a021, 498\u2013516 (1973)","journal-title":"Operations Research"},{"key":"57_CR2","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu search\u2013part I. ORSA J. Computing\u00a01, 190\u2013206 (1989)","journal-title":"ORSA J. Computing"},{"key":"57_CR3","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, P.M.: Optimization by simulated annealing. Science\u00a0220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"57_CR4","unstructured":"Holland, J.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. The University of Michigan Press (1975)"},{"key":"57_CR5","doi-asserted-by":"publisher","first-page":"2344","DOI":"10.1103\/PhysRevLett.79.2344","volume":"79","author":"M. Hasegawa","year":"1997","unstructured":"Hasegawa, M., Ikeguchi, T., Aihara, K.: Combination of chaotic neurodynamics with the 2-opt algorithm to solve traveling salesman problems. Physical Review Letters\u00a079, 2344\u20132347 (1997)","journal-title":"Physical Review Letters"},{"key":"57_CR6","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0893-6080(02)00017-5","volume":"15","author":"M. Hasegawa","year":"2002","unstructured":"Hasegawa, M., Ikeguchi, T., Aihara, K.: Solving large scale traveling salesman problems by chaotic neurodynamics. Neural Networks\u00a015, 271\u2013283 (2002)","journal-title":"Neural Networks"},{"key":"57_CR7","unstructured":"Hasegawa, M., Ikeguchi, T., Aihara, K.: On the effects of the k-opt method with chaotic neurodynamics. IEICE Technical Report 101, 25\u201332 (2001)"},{"key":"57_CR8","unstructured":"Motohashi, S., Matsuura, T., Ikeguchi, T.: Chaotic search method using the Lin-Kernighan algorithm for traveling salesman problems. In: Proceedings of International Symposium on Nonlinear Theory and its Applications (NOLTA), pp. 144\u2013147 (2008)"},{"key":"57_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0375-9601(90)90136-C","volume":"144","author":"K. Aihara","year":"1990","unstructured":"Aihara, K., Takabe, T., Toyoda, M.: Chaotic neural networks. Physics Letters A\u00a0144, 333\u2013340 (1990)","journal-title":"Physics Letters A"},{"key":"57_CR10","unstructured":"TSPLIB, \n                    \n                      http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/"},{"key":"57_CR11","unstructured":"Johnson, D.S., McGeoch, L.A., Glover, F., Rego, C.: 8th DIMACS implementation challenge: The traveling salesman problem (2000), \n                    \n                      http:\/\/www.research.att.com\/~dsj\/chtsp\/"},{"key":"57_CR12","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. Operations Research\u00a018, 1138\u20131162 (1970)","journal-title":"Operations Research"},{"key":"57_CR13","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M. Held","year":"1971","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees: Part II. Mathematical Programming\u00a01, 6\u201325 (1971)","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Artificial Neural Networks \u2013 ICANN 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04277-5_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T21:59:11Z","timestamp":1552168751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04277-5_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042768","9783642042775"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04277-5_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}