{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T10:51:50Z","timestamp":1782211910435,"version":"3.54.5"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031789335","type":"print"},{"value":"9783031789342","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-78934-2_44","type":"book-chapter","created":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T09:13:23Z","timestamp":1752484403000},"page":"457-466","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A GRASP Heuristic for the Open Sub-route Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Paulo Henrique S.","family":"Dezingrini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jos\u00e9 Elias Claudio","family":"Arroyo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matheus","family":"de Freitas Araujo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,7,15]]},"reference":[{"key":"44_CR1","first-page":"754","volume-title":"The Eleventh Annual ACM-SIAM Symposium on Discrete algorithms","author":"S Arora","year":"2000","unstructured":"Arora, S., Karakostas, G.: A 2+-approximation algorithm for the k-mst problem. In: The Eleventh Annual ACM-SIAM Symposium on Discrete algorithms, pp. 754\u2013759. Society for Industrial and Applied Mathematics, In (2000)"},{"issue":"6","key":"44_CR2","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas, E.: The prize collecting traveling salesman problem. Networks. 19(6), 621\u2013636 (1989)","journal-title":"Networks"},{"key":"44_CR3","first-page":"442","volume-title":"28th Annual ACM Symposium on Theory of Computing","author":"A Blum","year":"1996","unstructured":"Blum, A., Ravi, R., Vempala, S.: A constant-factor approximation algorithm for the k MST problem. In: 28th Annual ACM Symposium on Theory of Computing, pp. 442\u2013448. ACM (1996)"},{"key":"44_CR4","first-page":"89","volume-title":"The First International Conference on Soft Computing and Data Mining (SCDM)","author":"HH Chieng","year":"2014","unstructured":"Chieng, H.H., Wahid, N.: A performance comparison of genetic algorithm\u2019s mutation operators in n-cities open loop travelling salesman problem. In: The First International Conference on Soft Computing and Data Mining (SCDM), pp. 89\u201397 (2014)"},{"issue":"2","key":"44_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T Feo","year":"1995","unstructured":"Feo, T., e Resende, M.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6(2), 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"key":"44_CR6","first-page":"396","volume-title":"37th Annual ACM Symposium on Theory of Computing","author":"N Garg","year":"2005","unstructured":"Garg, N.: Saving an epsilon: a 2-approximation for the k-MST problem in graphs. In: 37th Annual ACM Symposium on Theory of Computing, pp. 396\u2013402. ACM (2005)"},{"issue":"3","key":"44_CR7","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"44_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-319-30634-6_6","volume-title":"Introduction to Nonparametric Statistics for the Biological Sciences Using R","author":"TW MacFarland","year":"2016","unstructured":"MacFarland, T.W., Yates, J.M., MacFarland, T.W., Yates, J.M.: Kruskal\u2013Wallis H-test for oneway analysis of variance (ANOVA) by ranks. In: Introduction to Nonparametric Statistics for the Biological Sciences Using R, pp. 177\u2013211. Springer (2016)"},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/B978-0-12-819714-1.00020-8","volume-title":"Nature-Inspired Computation and Swarm Intelligence","author":"E Osaba","year":"2020","unstructured":"Osaba, E., Yang, X.S., Del Ser, J.: Traveling salesman problem: a perspective review of recent research and new results with bio-inspired metaheuristics. In: Nature-Inspired Computation and Swarm Intelligence, pp. 135\u2013164. Elsevier (2020)"},{"issue":"4","key":"44_CR10","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1007\/s12597-020-00463-8","volume":"57","author":"V Pandiri","year":"2020","unstructured":"Pandiri, V., Singh, A.: Two multi-start heuristics for the k-traveling salesman problem. Opsearch. 57(4), 1164\u20131204 (2020)","journal-title":"Opsearch"},{"issue":"4","key":"44_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.5267\/j.jpm.2021.5.002","volume":"6","author":"P Singamsetty","year":"2021","unstructured":"Singamsetty, P., Thenepalle, J., Uruturu, B.: Solving open travelling salesman subset-tour problem through a hybrid genetic algorithm. J. Project Manag. 6(4), 209\u2013222 (2021)","journal-title":"J. Project Manag."},{"issue":"11","key":"44_CR12","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1016\/j.cor.2009.10.011","volume":"37","author":"A Subramanian","year":"2010","unstructured":"Subramanian, A., Drummond, L.M.d.A., Bentes, C., Ochi, L.S., Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37(11), 1899\u20131911 (2010)","journal-title":"Comput. Oper. Res."},{"key":"44_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.procs.2018.10.375","volume":"143","author":"P Venkatesh","year":"2018","unstructured":"Venkatesh, P., Srivastava, G., Singh, A.: A general variable neighborhood search algorithm for the k-traveling salesman problem. Procedia Comput. Sci. 143, 189\u2013196 (2018)","journal-title":"Procedia Comput. Sci."}],"container-title":["Lecture Notes in Networks and Systems","Hybrid Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78934-2_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T10:45:01Z","timestamp":1782211501000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78934-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031789335","9783031789342"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78934-2_44","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"value":"2367-3370","type":"print"},{"value":"2367-3389","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"15 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Hybrid Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vilnius","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lithuania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"his2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.mirlabs.net\/his23\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}