{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T18:54:34Z","timestamp":1758394474548,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031152252"},{"type":"electronic","value":"9783031152269"}],"license":[{"start":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T00:00:00Z","timestamp":1661385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T00:00:00Z","timestamp":1661385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-15226-9_32","type":"book-chapter","created":{"date-parts":[[2022,8,24]],"date-time":"2022-08-24T03:27:47Z","timestamp":1661311667000},"page":"334-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the\u00a0Travelling Salesman Problem with\u00a0Neighborhoods in\u00a0a\u00a0Polygonal World"],"prefix":"10.1007","author":[{"given":"Miroslav","family":"Kulich","sequence":"first","affiliation":[]},{"given":"Jan","family":"Vida\u0161i\u010d","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Mikula","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,25]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Alatartsev, S., Augustine, M., Ortmeier, F.: Constricting insertion heuristic for traveling salesman problem with neighborhoods. In: Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS-2013). AAAI (2013)","DOI":"10.1609\/icaps.v23i1.13539"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Alatartsev, S., Mersheeva, V., Augustine, M., Ortmeier, F.: On optimizing a sequence of robotic tasks. In: Proceedings of the International Conference on Intelligent Robots and Systems (IROS). IEEE (2013)","DOI":"10.1109\/IROS.2013.6696356"},{"key":"32_CR3","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: Concorde TSP Solver (2010)"},{"issue":"3","key":"32_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(94)90008-6","volume":"55","author":"EM Arkin","year":"1994","unstructured":"Arkin, E.M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Appl. Math. 55(3), 197\u2013218 (1994)","journal-title":"Discrete Appl. Math."},{"key":"32_CR5","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, Third Edition, 3rd edn. The MIT Press (2009)"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Dror, M., Efrat, A., Lubiw, A., Mitchell, J.S.B.: Touring a sequence of polygons. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC \u201903, p. 473\u2013482. Association for Computing Machinery, New York, NY, USA (2003)","DOI":"10.1145\/780542.780612"},{"issue":"2","key":"32_CR7","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1080\/10556788.2011.648932","volume":"28","author":"I Gentilini","year":"2013","unstructured":"Gentilini, I., Margot, F., Shimada, K.: The travelling salesman problem with neighbourhoods: Minlp solution. Optimization Methods and Software 28(2), 364\u2013378 (2013)","journal-title":"Optimization Methods and Software"},{"issue":"1","key":"32_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s11047-009-9111-6","volume":"9","author":"G Gutin","year":"2010","unstructured":"Gutin, G., Karapetyan, D.: A memetic algorithm for the generalized traveling salesman problem. Natural Computing 9(1), 47\u201360 (2010)","journal-title":"Natural Computing"},{"issue":"3","key":"32_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s12532-015-0080-8","volume":"7","author":"K Helsgaun","year":"2015","unstructured":"Helsgaun, K.: Solving the equality generalized traveling salesman problem using the lin-kernighan-helsgaun algorithm. Mathematical Programming Computation 7(3), 269\u2013287 (2015)","journal-title":"Mathematical Programming Computation"},{"key":"32_CR10","unstructured":"Mennell, W.: Heuristics for solving three routing problems: Close-enough traveling salesman problem, close-enough vehicle routing problem, sequence-dependent team orienteering problem. Ph.D. thesis, University of Maryland, USA (2009)"},{"key":"32_CR11","unstructured":"Pan, X., Li, F., Klette, R.: Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons. pp. 175\u2013178 (2010)"},{"issue":"8","key":"32_CR12","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Computers & operations research 34(8), 2403\u20132435 (2007)","journal-title":"Computers & operations research"},{"issue":"4","key":"32_CR13","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation science 40(4), 455\u2013472 (2006)","journal-title":"Transportation science"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Ryaben\u2019kii, V.S., Tsynkov, S.V.: A theoretical introduction to numerical analysis. Chapman and Hall\/CRC (2006)","DOI":"10.1201\/9781420011166"},{"issue":"1\u20133","key":"32_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0925-7721(01)00047-5","volume":"22","author":"JR Shewchuk","year":"2002","unstructured":"Shewchuk, J.R.: Delaunay refinement algorithms for triangular mesh generation. Computational geometry 22(1\u20133), 21\u201374 (2002)","journal-title":"Computational geometry"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.05.010","volume":"87","author":"SL Smith","year":"2017","unstructured":"Smith, S.L., Imeson, F.: Glns: An effective large neighborhood search heuristic for the generalized traveling salesman problem. Computers & Operations Research 87, 1\u201319 (2017)","journal-title":"Computers & Operations Research"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Yuan, B., Zhang, T.: Towards solving TSPN with arbitrary neighborhoods: A hybrid solution. In: M. Wagner, X. Li, T. Hendtlass (eds.) Artificial Life and Computational Intelligence, pp. 204\u2013215. Springer International Publishing (2017)","DOI":"10.1007\/978-3-319-51691-2_18"}],"container-title":["Lecture Notes in Networks and Systems","Robotics in Natural Settings"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15226-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T18:51:41Z","timestamp":1676487101000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15226-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,25]]},"ISBN":["9783031152252","9783031152269"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15226-9_32","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2022,8,25]]},"assertion":[{"value":"25 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CLAWAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Climbing and Walking Robots Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ponta Delgada","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"clawar2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/clawar.org\/clawar2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}