{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T15:00:15Z","timestamp":1726066815124},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030341510"},{"type":"electronic","value":"9783030341527"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-34152-7_4","type":"book-chapter","created":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T09:43:16Z","timestamp":1580722996000},"page":"43-52","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Heuristic Approach for Cluster TSP"],"prefix":"10.1007","author":[{"given":"Apurba","family":"Manna","sequence":"first","affiliation":[]},{"given":"Samir","family":"Maity","sequence":"additional","affiliation":[]},{"given":"Arindam","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,1]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s12597-012-0107-0","volume":"50","author":"ZH Ahmed","year":"2013","unstructured":"Ahmed, Z.H.: An exact algorithm for the clustered traveling salesman problem. Opsearch 50(2), 215\u2013228 (2013)","journal-title":"Opsearch"},{"key":"4_CR2","first-page":"13","volume":"2014","author":"ZH Ahmed","year":"2014","unstructured":"Ahmed, Z.H.: The ordered clustered travelling salesman problem: a hybrid genetic algorithm. Sci. World J. 2014, 13 (2014). Article ID 258207","journal-title":"Sci. World J."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.cie.2017.11.018","volume":"115","author":"PC Pop","year":"2018","unstructured":"Pop, P.C., et al.: A novel two-level optimization approach for clustered vehicle routing problem. Comput. Ind. Eng. 115, 304\u2013318 (2018)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0305-0548(75)90015-5","volume":"2","author":"JA Chisman","year":"1975","unstructured":"Chisman, J.A.: The clustered traveling salesman problem. Comput. Oper. Res. 2(2), 115\u2013119 (1975)","journal-title":"Comput. Oper. Res."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Helsgaun, K.: Solving the clustered traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm, May 2014","DOI":"10.1007\/s12532-015-0080-8"},{"issue":"9","key":"4_CR6","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1057\/palgrave.jors.2601420","volume":"53","author":"G Laporte","year":"2002","unstructured":"Laporte, G., Palekar, U.: Some applications of the clustered travelling salesman problem. J. Oper. Res. Soc. 53(9), 972\u2013976 (2002)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0377-2217(79)90099-7","volume":"3","author":"FCJ Lokin","year":"1979","unstructured":"Lokin, F.C.J.: Procedures for travelling salesman problems with additional constraints. Eur. J. Oper. Res. 3(2), 135\u2013141 (1979)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"4_CR8","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/0305-0548(95)00036-4","volume":"23","author":"A Hertz","year":"1996","unstructured":"Hertz, A., Gendreau, M., Laporte, G.: The traveling salesman problem with backhauls. Comput. Oper. Res. 23(5), 501\u2013508 (1996)","journal-title":"Comput. Oper. Res."},{"key":"4_CR9","first-page":"39","volume":"5","author":"A Roy","year":"2017","unstructured":"Roy, A., Maity, S., Maiti, M.: An intelligent hybrid algorithm for 4-dimensional TSP. J. Ind. Inf. Integr. 5, 39\u201350 (2017)","journal-title":"J. Ind. Inf. Integr."},{"issue":"4","key":"4_CR10","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.14488\/1676-1901.v14i4.1721","volume":"14","author":"M\u00e1rio Mestria","year":"2014","unstructured":"Mestria, M.: Heuristic methods using variable neighborhood random local search for the clustered traveling salesman problem. Revista Produo Online 14 (2014). \nhttps:\/\/doi.org\/10.14488\/1676-1901.v14i4.1721","journal-title":"Revista Produ\u00e7\u00e3o Online"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2017.12.018","volume":"116","author":"M\u00e1rio Mestria","year":"2018","unstructured":"Mestria, M.: New hybrid heuristic algorithm for the clustered traveling salesman problem. Comput. Ind. Eng. 116 (2017). \nhttps:\/\/doi.org\/10.1016\/j.cie.2017.12.018.","journal-title":"Computers & Industrial Engineering"},{"key":"4_CR12","unstructured":"Phuong, H.N., et al.: Solving the clustered traveling salesman problem with d-relaxed priority rule, October 2018"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIBA traveling salesman problem library. ORSA J. Comput. 3, 376\u2013384 (1991). ISSN 0899-1499","journal-title":"ORSA J. Comput."},{"issue":"4","key":"4_CR14","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1109\/4235.687888","volume":"1","author":"F Zhang","year":"1997","unstructured":"Zhang, F., Zhang, Y.F., Nee, A.Y.C.: Using genetic algorithms in process planning for job shop machining. IEEE Trans. Evol. Comput. 1(4), 278\u2013289 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.07.008","volume":"89","author":"Tianjiao Zhang","year":"2018","unstructured":"Zhang, T., et al.: Metaheuristics for the tabu clustered traveling salesman problem. Comput. Oper. Res. 89 (2017). \nhttps:\/\/doi.org\/10.1016\/j.cor.2017.07.008.","journal-title":"Computers & Operations Research"}],"container-title":["Studies in Computational Intelligence","Recent Advances in Intelligent Information Systems and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34152-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T09:57:04Z","timestamp":1580723824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34152-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030341510","9783030341527"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34152-7_4","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICITAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Technology and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Haldia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icitam2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/hithaldia.co.in\/icitam2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}