{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T06:02:47Z","timestamp":1769839367923,"version":"3.49.0"},"reference-count":36,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T00:00:00Z","timestamp":1693785600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T00:00:00Z","timestamp":1693785600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"publisher","award":["22-05762S"],"award-info":[{"award-number":["22-05762S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,9,4]]},"DOI":"10.1109\/ecmr59166.2023.10256328","type":"proceedings-article","created":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T17:31:27Z","timestamp":1695835887000},"page":"1-6","source":"Crossref","is-referenced-by-count":7,"title":["On Improvement Heuristic to Solutions of the Close Enough Traveling Salesman Problem in Environments with Obstacles"],"prefix":"10.1109","author":[{"given":"Jind\u0159i\u0161ka","family":"Deckerov\u00e1","sequence":"first","affiliation":[{"name":"Czech Technical University,Faculty of Electrical Engineering,Department of Computer Science,Prague,Czech Republic"}]},{"given":"Krist\u00fdna","family":"Ku\u010derov\u00e1","sequence":"additional","affiliation":[{"name":"Czech Technical University,Faculty of Electrical Engineering,Department of Computer Science,Prague,Czech Republic"}]},{"given":"Jan","family":"Faigl","sequence":"additional","affiliation":[{"name":"Czech Technical University,Faculty of Electrical Engineering,Department of Computer Science,Prague,Czech Republic"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2307\/3010604"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93031-2_27"},{"key":"ref12","author":"deckerov\u00e1","year":"2021","journal-title":"Generalized routing problems with continuous neighborhoods"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/73393.73410"},{"key":"ref15","author":"mennell","year":"2009","journal-title":"Heuristics for Solving Three Routing Problems Close-Enough Traveling Salesman Problem Close-Enough Vehicle Routing Problem Sequence-Dependent Team Orienteering Problem"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2005.01.010"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985795"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2678482"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.05.019"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1057626"},{"key":"ref33","author":"helsgaun","year":"2013","journal-title":"GLKH"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942974"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.11.005"},{"key":"ref2","author":"applegate","year":"2007","journal-title":"The Traveling Salesman Problem A Computational Study"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-015-0190-6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.05.079"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v23i1.13539"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00047-6"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2900507"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2017.07.010"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2016.0711"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2010.08.026"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2019.101593"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90008-6"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2013.0574"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195909002897"},{"key":"ref28","author":"fanta","year":"2021","journal-title":"The Close Enough Travelling Salesman Problem in the polygonal domain"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2012.08.013"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600439"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2011.2181683"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2009.4804365"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2011.648932"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-39934-8_16"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460581"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1062"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.2970646"}],"event":{"name":"2023 European Conference on Mobile Robots (ECMR)","location":"Coimbra, Portugal","start":{"date-parts":[[2023,9,4]]},"end":{"date-parts":[[2023,9,7]]}},"container-title":["2023 European Conference on Mobile Robots (ECMR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10256258\/10256267\/10256328.pdf?arnumber=10256328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T17:51:23Z","timestamp":1697478683000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10256328\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,4]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/ecmr59166.2023.10256328","relation":{},"subject":[],"published":{"date-parts":[[2023,9,4]]}}}