{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T13:33:42Z","timestamp":1648560822322},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1016\/0950-7051(94)90003-5","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T04:45:55Z","timestamp":1047703555000},"page":"169-176","source":"Crossref","is-referenced-by-count":1,"title":["Parallel search-and-learn technique for solving large scale travelling-salesperson problems"],"prefix":"10.1016","volume":"7","author":[{"given":"C.P.","family":"Ravikumar","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0950-7051(94)90003-5_BIB1","series-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","year":"1985"},{"issue":"3","key":"10.1016\/0950-7051(94)90003-5_BIB2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0141-9331(92)90038-U","article-title":"Solving large-scale traveling salesperson problems on parallel machines","volume":"16","author":"Ravikumar","year":"1992","journal-title":"Microprocessors and Microsystems"},{"key":"10.1016\/0950-7051(94)90003-5_BIB3","first-page":"310","article-title":"A combined clustering and parallel optimization approach to the travelling salesman problem","author":"Freisblen","year":"1991"},{"issue":"6","key":"10.1016\/0950-7051(94)90003-5_BIB4","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/358080.358103","article-title":"Anomalies in parallel branch-and-bound algorithms","volume":"27","author":"Lai","year":"1984","journal-title":"Communications of ACM"},{"key":"10.1016\/0950-7051(94)90003-5_BIB5","doi-asserted-by":"crossref","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions of the traveling salesman problem","author":"Lin","year":"1965","journal-title":"Bell System Technical Journal"},{"key":"10.1016\/0950-7051(94)90003-5_BIB6","year":"1989"},{"issue":"1","key":"10.1016\/0950-7051(94)90003-5_BIB7","doi-asserted-by":"crossref","DOI":"10.1016\/0167-6377(87)90002-2","article-title":"Optimization of a 532-city symmetric travelling salesman problem by branch and cut","volume":"6","author":"Padberg","year":"1987","journal-title":"Operations Research Letters"}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0950705194900035?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0950705194900035?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T12:20:19Z","timestamp":1553516419000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0950705194900035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0950705194900035"],"URL":"https:\/\/doi.org\/10.1016\/0950-7051(94)90003-5","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}