{"id":"https://openalex.org/W4387089483","doi":"https://doi.org/10.1109/ecmr59166.2023.10256328","title":"On Improvement Heuristic to Solutions of the Close Enough Traveling Salesman Problem in Environments with Obstacles","display_name":"On Improvement Heuristic to Solutions of the Close Enough Traveling Salesman Problem in Environments with Obstacles","publication_year":2023,"publication_date":"2023-09-04","ids":{"openalex":"https://openalex.org/W4387089483","doi":"https://doi.org/10.1109/ecmr59166.2023.10256328"},"language":"en","primary_location":{"id":"doi:10.1109/ecmr59166.2023.10256328","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ecmr59166.2023.10256328","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 European Conference on Mobile Robots (ECMR)","raw_type":"proceedings-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/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":true,"raw_author_name":"Jind\u0159i\u0161ka Deckerov\u00e1","raw_affiliation_strings":["Czech Technical University,Faculty of Electrical Engineering,Department of Computer Science,Prague,Czech Republic","Department of Computer Science, Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Czech Technical University,Faculty of Electrical Engineering,Department of Computer Science,Prague,Czech Republic","institution_ids":["https://openalex.org/I44504214"]},{"raw_affiliation_string":"Department of Computer Science, Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003547969","display_name":"Krist\u00fdna Ku\u010derov\u00e1","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":"Krist\u00fdna Ku\u010derov\u00e1","raw_affiliation_strings":["Czech Technical University,Faculty of Electrical Engineering,Department of Computer Science,Prague,Czech Republic","Department of Computer Science, Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Czech Technical University,Faculty of Electrical Engineering,Department of Computer Science,Prague,Czech Republic","institution_ids":["https://openalex.org/I44504214"]},{"raw_affiliation_string":"Department of Computer Science, Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","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":false,"raw_author_name":"Jan Faigl","raw_affiliation_strings":["Czech Technical University,Faculty of Electrical Engineering,Department of Computer Science,Prague,Czech Republic","Department of Computer Science, Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Czech Technical University,Faculty of Electrical Engineering,Department of Computer Science,Prague,Czech Republic","institution_ids":["https://openalex.org/I44504214"]},{"raw_affiliation_string":"Department of Computer Science, 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/A5083616309"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":0.8609,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.75771112,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"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.9994000196456909,"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.9983000159263611,"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.9851999878883362,"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.8306776881217957},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.816687822341919},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6270028948783875},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.46333447098731995},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4390510618686676},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4189044237136841},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4150035083293915},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34846216440200806},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33789190649986267},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.28181886672973633},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26685088872909546},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07865127921104431}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8306776881217957},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.816687822341919},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6270028948783875},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.46333447098731995},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4390510618686676},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4189044237136841},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4150035083293915},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34846216440200806},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33789190649986267},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28181886672973633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26685088872909546},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07865127921104431},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ecmr59166.2023.10256328","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ecmr59166.2023.10256328","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 European Conference on Mobile Robots (ECMR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1317784959","display_name":null,"funder_award_id":"22-05762S","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"}],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W626292722","https://openalex.org/W1979824502","https://openalex.org/W1989307874","https://openalex.org/W2013457645","https://openalex.org/W2018702978","https://openalex.org/W2021281857","https://openalex.org/W2039204626","https://openalex.org/W2042378559","https://openalex.org/W2047747795","https://openalex.org/W2068802223","https://openalex.org/W2072931689","https://openalex.org/W2103209505","https://openalex.org/W2110824994","https://openalex.org/W2113076619","https://openalex.org/W2117257995","https://openalex.org/W2138428785","https://openalex.org/W2141708863","https://openalex.org/W2253899129","https://openalex.org/W2273809405","https://openalex.org/W2400812379","https://openalex.org/W2528929878","https://openalex.org/W2600765363","https://openalex.org/W2738622099","https://openalex.org/W2798425997","https://openalex.org/W2803452670","https://openalex.org/W2901943120","https://openalex.org/W2915977602","https://openalex.org/W2963816708","https://openalex.org/W2983251291","https://openalex.org/W3004195199","https://openalex.org/W3099194593","https://openalex.org/W3103379443","https://openalex.org/W3121675905","https://openalex.org/W4245969612"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W4297427155","https://openalex.org/W2975368677","https://openalex.org/W3025823153","https://openalex.org/W3136451934","https://openalex.org/W3200006077","https://openalex.org/W2170228269","https://openalex.org/W4243663106","https://openalex.org/W2011675579"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"a":[5,31,45,67,85],"novel":[6,86],"improvement":[7],"heuristic":[8,98,112,127],"to":[9,43,49,59,95,100,175],"address":[10,63],"the":[11,34,40,55,60,74,78,101,108,117,121,126,138,146,154,158,162,168,171,176,180],"Close":[12],"Enough":[13],"Traveling":[14,35],"Salesman":[15,36],"Problem":[16,37],"in":[17,66],"environments":[18],"with":[19,54,70,110],"obstacles":[20],"(":[21],"<tex":[22,27,102,181],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[23,28,103,182],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\text{CETSP}_{\\text{obs}}$</tex>":[24,29,104,183],").":[25],"The":[26,141,165],"is":[30,42],"variant":[32],"of":[33,47,57,129,153,170,179],"(TSP),":[38],"where":[39,73],"goal":[41],"find":[44],"sequence":[46,147],"visits":[48,58],"given":[50],"disk-shaped":[51],"regions":[52,79,156],"together":[53],"points":[56],"regions.":[61],"We":[62,83,106],"challenging":[64],"instances":[65],"polygonal":[68,71],"domain":[69],"obstacles,":[72],"final":[75],"path":[76],"connecting":[77],"must":[80],"be":[81],"collision-free.":[82],"propose":[84],"Post-Optimization":[87,123],"procedure":[88],"using":[89,149],"Mixed":[90],"Integer":[91],"Non-Linear":[92],"Programming":[93],"(MINLP)":[94],"improve":[96],"existing":[97,111],"solutions":[99,128,160],".":[105,184],"deploy":[107],"method":[109],"solvers":[113,132],"and":[114,133],"based":[115],"on":[116],"presented":[118],"evaluation":[119,143],"results,":[120],"proposed":[122,172],"significantly":[124],"improves":[125],"all":[130],"examined":[131],"makes":[134],"them":[135],"competitive":[136],"regarding":[137],"solution":[139,174],"quality.":[140],"statistical":[142],"reveals":[144],"that":[145],"found":[148],"relatively":[150],"sparse":[151],"sampling":[152],"disk":[155],"yields":[157],"best":[159],"among":[161],"evaluated":[163],"solvers.":[164],"results":[166],"support":[167],"benefit":[169],"MINLPbased":[173],"continuous":[177],"optimization":[178]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}