{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:34:32Z","timestamp":1762324472967},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T00:00:00Z","timestamp":1555977600000},"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":["Mobile Netw Appl"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s11036-019-01258-y","type":"journal-article","created":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T09:04:24Z","timestamp":1556010264000},"page":"1210-1213","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["k-RNN: Extending NN-heuristics for the TSP"],"prefix":"10.1007","volume":"24","author":[{"given":"Nikolas","family":"Klug","sequence":"first","affiliation":[]},{"given":"Alok","family":"Chauhan","sequence":"additional","affiliation":[]},{"given":"Vijayakumar","family":"V","sequence":"additional","affiliation":[]},{"given":"Ramesh","family":"Ragala","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,23]]},"reference":[{"key":"1258_CR1","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/opre.16.3.538","volume":"16","author":"M Bellmore","year":"1968","unstructured":"Bellmore M, Nemhauser GL (1968) The traveling salesman problem: a survey. Oper Res 16:538\u2013558","journal-title":"Oper Res"},{"issue":"6","key":"1258_CR2","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes GA (1958) A method for solving Traveling-Salesman problems. Oper Res 6(6):791\u2013812","journal-title":"Oper Res"},{"issue":"1","key":"1258_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0166-218X(01)00195-0","volume":"117","author":"G Gutin","year":"2002","unstructured":"Gutin G, Yeo A, Zverovich A (2002) Traveling salesman should not be greedy:domination analysis of greedy-type heuristics for the TSP. Discret Appl Math 117(1):81\u201386","journal-title":"Discret Appl Math"},{"issue":"10","key":"1258_CR4","doi-asserted-by":"publisher","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 of the traveling salesman problem. Bell Syst Tech J 44(10):2245\u20132269","journal-title":"Bell Syst Tech J"},{"issue":"2","key":"1258_CR5","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 BW (1973) An effective heuristic algorithm for the Traveling-Salesman problem. Oper Res 21(2):498\u2013516","journal-title":"Oper Res"},{"key":"1258_CR6","unstructured":"Nagraj A (2011) Madhyasth Darshan Sahastitvavaad par Aadharit Samvaad (Part 1). Jeevan Vidhya Prakashan"},{"key":"1258_CR7","unstructured":"Nagraj A (2013) Madhyasth Darshan Sahastitvavaad par Aadharit Samvaad (Part 2). Jeevan Vidhya Prakashan"},{"issue":"4","key":"1258_CR8","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB - A traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"},{"key":"1258_CR9","doi-asserted-by":"publisher","first-page":"38921","DOI":"10.1109\/ACCESS.2018.2853129","volume":"6","author":"E Liao","year":"2018","unstructured":"Liao E, Liu C (2018) A hierarchical algorithm based on density peaks clustering and ant colony optimization for traveling salesman problem. IEEE Access 6:38921\u201338933","journal-title":"IEEE Access"},{"issue":"1","key":"1258_CR10","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TSMCB.2006.880136","volume":"37","author":"HD Nguyen","year":"2007","unstructured":"Nguyen HD, Yoshihara I, Yamamori K, Yasunaga M (2007) Implementation of an effective hybrid GA for large-scale traveling salesman problems. IEEE Trans Syst Man Cybern B Cybern 37(1): 92\u201399","journal-title":"IEEE Trans Syst Man Cybern B Cybern"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-019-01258-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11036-019-01258-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-019-01258-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T23:19:20Z","timestamp":1587511160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11036-019-01258-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,23]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["1258"],"URL":"https:\/\/doi.org\/10.1007\/s11036-019-01258-y","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"value":"1383-469X","type":"print"},{"value":"1572-8153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,23]]},"assertion":[{"value":"23 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}