{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T15:14:27Z","timestamp":1771082067438,"version":"3.50.1"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Czech Science Foundation (GAČR) under Research Projects","award":["16-24206S"],"award-info":[{"award-number":["16-24206S"]}]},{"name":"Czech Science Foundation (GAČR) under Research Projects","award":["19-20238S"],"award-info":[{"award-number":["19-20238S"]}]},{"name":"OP VVV MEYS","award":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000765"],"award-info":[{"award-number":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000765"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/lra.2019.2900507","type":"journal-article","created":{"date-parts":[[2019,2,20]],"date-time":"2019-02-20T19:50:25Z","timestamp":1550692225000},"page":"2439-2446","source":"Crossref","is-referenced-by-count":26,"title":["Fast Heuristics for the 3-D Multi-Goal Path Planning Based on the Generalized Traveling Salesman Problem With Neighborhoods"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6193-0792","authenticated-orcid":false,"given":"Jan","family":"Faigl","sequence":"first","affiliation":[]},{"given":"Petr","family":"Vana","sequence":"additional","affiliation":[]},{"given":"Jindriska","family":"Deckerova","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","article-title":"CPU performance comparison","year":"2018"},{"key":"ref32","article-title":"Fast heuristics for GTSPN-based 3d multi-goal path planning","author":"faigl","year":"2018"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.05.019"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2011.648932"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942974"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1057626"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2307\/3010604"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-015-0080-8"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.05.010"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.1993.11732212"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2005.01.010"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00047-6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00259-9"},{"key":"ref28","article-title":"Randomly generated GTSPN instances","author":"vicencio","year":"2014"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460581"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7353714"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1007\/b101971","author":"gutin","year":"2007","journal-title":"The Traveling Salesman Problem and Its Variations"},{"key":"ref6","first-page":"2","article-title":"Constricting insertion heuristic for traveling salesman problem with neighborhoods","author":"alatartsev","year":"0","journal-title":"Proc Int Conf Int Conf Automated Planning Scheduling"},{"key":"ref29","article-title":"GLKH","author":"helsgaun","year":"2013"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2010.938844"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2011.2181683"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2678482"},{"key":"ref2","author":"applegate","year":"2007","journal-title":"The Traveling Salesman Problem A Computational Study"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1062"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-015-0190-6"},{"key":"ref20","article-title":"A PTAS for euclidean TSP with hyperplane neighborhoods","author":"antoniadis","year":"2018"},{"key":"ref22","first-page":"145","author":"dong","year":"2007","journal-title":"Heuristic Approaches for a TSP Variant The Automatic Meter Reading Shortest Tour Problem"},{"key":"ref21","first-page":"271","author":"gulczynski","year":"2006","journal-title":"The Close Enough Traveling Salesman Problem A Discussion of Several Heuristics"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.05.079"},{"key":"ref23","article-title":"Heuristics for solving three routing problems: Close-enough traveling salesman problem, close-enough vehicle routing problem, sequence-dependent team orienteering problem","author":"mennell","year":"2009"},{"key":"ref26","article-title":"Multi-goal path optimization for robotic systems with redundancy based on the traveling salesman problem with neighborhoods","author":"gentilini","year":"2012"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195909002897"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/8668830\/08645724.pdf?arnumber=8645724","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:13:50Z","timestamp":1657746830000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8645724\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":33,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/lra.2019.2900507","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7]]}}}