{"id":"https://openalex.org/W2915977602","doi":"https://doi.org/10.1109/lra.2019.2900507","title":"Fast Heuristics for the 3-D Multi-Goal Path Planning Based on the Generalized Traveling Salesman Problem With Neighborhoods","display_name":"Fast Heuristics for the 3-D Multi-Goal Path Planning Based on the Generalized Traveling Salesman Problem With Neighborhoods","publication_year":2019,"publication_date":"2019-02-20","ids":{"openalex":"https://openalex.org/W2915977602","doi":"https://doi.org/10.1109/lra.2019.2900507","mag":"2915977602"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2019.2900507","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2019.2900507","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073496345","display_name":"Jan Faigl","orcid":"https://orcid.org/0000-0002-6193-0792"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jan Faigl","raw_affiliation_strings":["Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0002-6193-0792","affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030097640","display_name":"Petr V\u00e1\u0148a","orcid":null},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Petr Vana","raw_affiliation_strings":["Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083616309","display_name":"Jind\u0159i\u0161ka Deckerov\u00e1","orcid":"https://orcid.org/0000-0001-7182-8698"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jindriska Deckerova","raw_affiliation_strings":["Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5073496345"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":1.4296,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.85241819,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"4","issue":"3","first_page":"2439","last_page":"2446"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9847999811172485,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8491681218147278},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8351190686225891},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7145799994468689},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6038389801979065},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5906209945678711},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5608347654342651},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5462883710861206},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5442585349082947},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5432800054550171},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5032956004142761},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4273269474506378},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3125230669975281},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21864250302314758},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19107061624526978}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8491681218147278},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8351190686225891},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7145799994468689},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6038389801979065},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5906209945678711},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5608347654342651},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5462883710861206},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5442585349082947},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5432800054550171},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5032956004142761},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4273269474506378},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3125230669975281},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21864250302314758},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19107061624526978},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2019.2900507","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2019.2900507","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.8100000023841858}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W19308768","https://openalex.org/W33566489","https://openalex.org/W626292722","https://openalex.org/W1517470327","https://openalex.org/W1571087346","https://openalex.org/W1989307874","https://openalex.org/W2009945360","https://openalex.org/W2013457645","https://openalex.org/W2021281857","https://openalex.org/W2035400240","https://openalex.org/W2047747795","https://openalex.org/W2072931689","https://openalex.org/W2106378689","https://openalex.org/W2113076619","https://openalex.org/W2117257995","https://openalex.org/W2141708863","https://openalex.org/W2163557644","https://openalex.org/W2215133879","https://openalex.org/W2253899129","https://openalex.org/W2273809405","https://openalex.org/W2400812379","https://openalex.org/W2600765363","https://openalex.org/W2614564353","https://openalex.org/W2796815965","https://openalex.org/W2803452670","https://openalex.org/W2963816708","https://openalex.org/W3121675905","https://openalex.org/W4245969612","https://openalex.org/W6600775575","https://openalex.org/W6712815176","https://openalex.org/W6750401590","https://openalex.org/W7000979407"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W2359992618","https://openalex.org/W4376138746","https://openalex.org/W2362402143","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2308371765","https://openalex.org/W2171568915","https://openalex.org/W2265604726","https://openalex.org/W2033053473"],"abstract_inverted_index":{"In":[0],"this":[1],"letter,":[2],"we":[3,127],"address":[4],"the":[5,28,44,76,80,85,98,114,131,137,148,166,179],"multi-goal":[6,51],"path":[7,14,52],"planning":[8],"problem":[9,23,31,45,77],"to":[10,15,47,53,92,129,141,187],"determine":[11,48],"a":[12,17,25,49,72,94,107,111,122,144],"cost-efficient":[13],"visit":[16,54],"set":[18],"of":[19,27,40,59,67,97,113,147,190],"three-dimensional":[20],"regions.":[21],"The":[22,101,159],"is":[24,46,78,104,118],"variant":[26],"traveling":[29],"salesman":[30],"with":[32],"neighborhoods":[33],"(TSPN)":[34],"where":[35],"an":[36],"individual":[37],"neighborhood":[38,64,73],"consists":[39],"multiple":[41],"regions,":[42,69],"and":[43,75],"shortest":[50],"at":[55],"least":[56],"one":[57],"region":[58],"each":[60,63],"neighborhood.":[61],"Because":[62],"may":[65],"consist":[66],"several":[68],"it":[70],"forms":[71],"set,":[74],"called":[79,136],"generalized":[81,115],"TSPN":[82],"(GTSPN)":[83],"in":[84],"literature.":[86],"We":[87],"propose":[88,128],"two":[89,188],"heuristic":[90],"algorithms":[91],"provide":[93,173],"feasible":[95,145],"solution":[96,112,146],"GTSPN":[99,149,167],"quickly.":[100],"first":[102],"algorithm":[103],"based":[105],"on":[106,162],"decoupled":[108],"approach":[109],"using":[110],"TSP":[116],"that":[117,150,169],"further":[119,153],"improved":[120,154],"by":[121,155],"quick":[123],"post-processing":[124],"procedure.":[125],"Besides,":[126],"employ":[130],"existing":[132,163],"unsupervised":[133],"learning":[134],"technique":[135],"growing":[138],"self-organizing":[139],"array":[140],"quickly":[142],"find":[143],"can":[151],"be":[152],"more":[156],"demanding":[157],"optimization.":[158],"reported":[160],"results":[161],"benchmarks":[164],"for":[165],"indicate":[168],"both":[170],"proposed":[171],"heuristics":[172],"better":[174],"or":[175],"competitive":[176],"solutions":[177],"than":[178],"state-of-the-art":[180],"reference":[181],"algorithm,":[182],"but":[183],"they":[184],"are":[185],"up":[186],"orders":[189],"magnitude":[191],"faster.":[192]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}