{"id":"https://openalex.org/W2558572364","doi":"https://doi.org/10.1109/tsp.2016.7760861","title":"Traveling Salesman Problem optimization by means of graph-based algorithm","display_name":"Traveling Salesman Problem optimization by means of graph-based algorithm","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2558572364","doi":"https://doi.org/10.1109/tsp.2016.7760861","mag":"2558572364"},"language":"en","primary_location":{"id":"doi:10.1109/tsp.2016.7760861","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2016.7760861","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 39th International Conference on Telecommunications and Signal Processing (TSP)","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":null,"display_name":"Jiri Stastny","orcid":null},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jiri Stastny","raw_affiliation_strings":["Department of Automation and Computer Science, Brno University of Technology, Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Automation and Computer Science, Brno University of Technology, Brno, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065487118","display_name":"Vladislav \u0160korpil","orcid":"https://orcid.org/0000-0003-0957-0563"},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Vladislav Skorpil","raw_affiliation_strings":["Department of Telecommunications, Brno University of Technology, Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Telecommunications, Brno University of Technology, Brno, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109122446","display_name":"Lubom\u00edr \u010c\u00ed\u017eek","orcid":null},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Lubomir Cizek","raw_affiliation_strings":["Department of Automation and Computer Science, Brno University of Technology, Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Automation and Computer Science, Brno University of Technology, Brno, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I60587646"],"apc_list":null,"apc_paid":null,"fwci":0.8887,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.85147889,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"207","last_page":"210"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9970999956130981,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9970999956130981,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9959999918937683,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.902948260307312},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6043227314949036},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5173668265342712},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4989809989929199},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44431281089782715},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41731441020965576},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37394705414772034},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32508599758148193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23571842908859253}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.902948260307312},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6043227314949036},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5173668265342712},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4989809989929199},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44431281089782715},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41731441020965576},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37394705414772034},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32508599758148193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23571842908859253}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tsp.2016.7760861","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2016.7760861","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 39th International Conference on Telecommunications and Signal Processing (TSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W72858603","https://openalex.org/W1982809790","https://openalex.org/W2117303033","https://openalex.org/W2165142526","https://openalex.org/W2171149164","https://openalex.org/W2478342984","https://openalex.org/W6602916226","https://openalex.org/W6684149783"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2361554335","https://openalex.org/W4200179302","https://openalex.org/W8433631","https://openalex.org/W4220987199","https://openalex.org/W2362402143"],"abstract_inverted_index":{"There":[0],"are":[1,79],"many":[2,141],"different":[3],"algorithms":[4],"for":[5,36,52],"optimization":[6,37],"of":[7,14,32,38,55,71,76,86,97,104,110],"logistic":[8],"and":[9,12,101],"scheduling":[10,39],"problems":[11,40],"one":[13],"the":[15,84,88,111,115],"most":[16],"known":[17],"is":[18,49],"Genetic":[19],"algorithm.":[20,73],"In":[21],"this":[22,129],"paper":[23],"we":[24,60],"take":[25],"a":[26,30],"deeper":[27],"look":[28],"at":[29],"draft":[31],"new":[33],"graph-based":[34],"algorithm":[35,47,117],"based":[41],"on":[42,63],"Generalized":[43],"Lifelong":[44],"Planning":[45],"A*":[46],"which":[48],"usually":[50],"used":[51],"path":[53],"planning":[54],"mobile":[56],"robots.":[57],"And":[58],"then":[59,80],"test":[61],"it":[62,130,143],"Traveling":[64],"Salesman":[65],"Problem":[66],"(TSP)":[67],"against":[68],"classic":[69],"implementation":[70],"genetic":[72,137],"The":[74],"results":[75,112],"these":[77,106],"tests":[78],"compared":[81],"according":[82],"to":[83,128],"time":[85,103],"finding":[87,105],"best":[89],"path,":[90],"its":[91],"travel":[92,98],"distance,":[93],"an":[94,124],"average":[95,102],"distance":[96],"paths":[99],"found":[100],"paths.":[107],"A":[108],"comparison":[109],"shows":[113],"that":[114],"proposed":[116],"has":[118],"very":[119],"fast":[120],"convergence":[121],"rate":[122],"towards":[123],"optimal":[125],"solution.":[126],"Thanks":[127],"reaches":[131,145],"not":[132],"only":[133],"better":[134],"solutions":[135],"than":[136],"algorithm,":[138],"but":[139],"in":[140],"instances":[142],"also":[144],"them":[146],"faster.":[147]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}