{"id":"https://openalex.org/W4229024675","doi":"https://doi.org/10.1145/3476883.3524046","title":"A new approach to the traveling salesman problem","display_name":"A new approach to the traveling salesman problem","publication_year":2022,"publication_date":"2022-04-18","ids":{"openalex":"https://openalex.org/W4229024675","doi":"https://doi.org/10.1145/3476883.3524046"},"language":"en","primary_location":{"id":"doi:10.1145/3476883.3524046","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3476883.3524046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Southeast Conference","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100651364","display_name":"Weiqi Li","orcid":"https://orcid.org/0000-0003-1218-0478"},"institutions":[{"id":"https://openalex.org/I4210092198","display_name":"University of Michigan\u2013Flint","ror":"https://ror.org/01c3xc117","country_code":"US","type":"education","lineage":["https://openalex.org/I4210092198"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Weiqi Li","raw_affiliation_strings":["University of Michigan-Flint"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan-Flint","institution_ids":["https://openalex.org/I4210092198"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100651364"],"corresponding_institution_ids":["https://openalex.org/I4210092198"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"52","last_page":"59"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994999766349792,"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.9994999766349792,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9955000281333923,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9948999881744385,"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.818968653678894},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.7017822861671448},{"id":"https://openalex.org/keywords/iterative-deepening-depth-first-search","display_name":"Iterative deepening depth-first search","score":0.6929172277450562},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6734379529953003},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.6691722869873047},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6581439971923828},{"id":"https://openalex.org/keywords/combinatorial-search","display_name":"Combinatorial search","score":0.6461349129676819},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.6179170608520508},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5901782512664795},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5753344893455505},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.5576255917549133},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5408916473388672},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.5104883909225464},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.48645636439323425},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.45574119687080383},{"id":"https://openalex.org/keywords/search-problem","display_name":"Search problem","score":0.42806458473205566},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4207209348678589},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3892028033733368}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.818968653678894},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.7017822861671448},{"id":"https://openalex.org/C14362708","wikidata":"https://www.wikidata.org/wiki/Q1675274","display_name":"Iterative deepening depth-first search","level":5,"score":0.6929172277450562},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6734379529953003},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.6691722869873047},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6581439971923828},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.6461349129676819},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.6179170608520508},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5901782512664795},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5753344893455505},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.5576255917549133},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5408916473388672},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5104883909225464},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.48645636439323425},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.45574119687080383},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.42806458473205566},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4207209348678589},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3892028033733368},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3476883.3524046","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3476883.3524046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Southeast Conference","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":13,"referenced_works":["https://openalex.org/W1983918081","https://openalex.org/W2042231724","https://openalex.org/W2047525231","https://openalex.org/W2047749000","https://openalex.org/W2055370404","https://openalex.org/W2079868147","https://openalex.org/W2085081875","https://openalex.org/W2091469954","https://openalex.org/W2093399001","https://openalex.org/W2106371135","https://openalex.org/W2145255833","https://openalex.org/W2150470619","https://openalex.org/W2908594071"],"related_works":["https://openalex.org/W2808808802","https://openalex.org/W2064794194","https://openalex.org/W2125033394","https://openalex.org/W2593395660","https://openalex.org/W2354057059","https://openalex.org/W3106196307","https://openalex.org/W3014882394","https://openalex.org/W2998661990","https://openalex.org/W1588279264","https://openalex.org/W4229024675"],"abstract_inverted_index":{"The":[0,22,92,155],"intrinsic":[1],"difficulty":[2,24],"of":[3,15,46,128,136,162],"the":[4,12,19,29,36,59,63,71,90,107,137,147,152],"Traveling":[5],"Salesman":[6],"Problem":[7],"(TSP)":[8],"is":[9,31,43,103,119,143],"associated":[10],"with":[11,25],"combinatorial":[13],"explosion":[14],"potential":[16],"solutions":[17,49],"in":[18],"solution":[20,138],"space.":[21,139],"significant":[23],"search":[26,72,86,93,97,102,108,118,130,142,146,165],"algorithms":[27],"for":[28,77,88,111],"TSP":[30],"how":[32],"to":[33,61,105,133,145,150],"quickly":[34,110],"find":[35,62,151],"optimal":[37,64,153],"tour":[38],"and":[39,75,98,159],"make":[40],"sure":[41],"it":[42],"optimal.":[44],"Scamming":[45],"all":[47,58],"possible":[48],"requires":[50],"exponential":[51],"computing":[52,160],"time.":[53],"Do":[54],"we":[55,68],"need":[56],"exploring":[57],"possibilities":[60],"solution?":[65],"How":[66],"can":[67],"narrow":[69],"down":[70],"space":[73,109],"effectively":[74],"efficiently":[76],"an":[78],"exhausted":[79,99,112,141],"search?":[80],"This":[81],"paper":[82],"describes":[83],"a":[84,122],"new":[85,164],"strategy":[87,94],"solving":[89],"TSP.":[91],"combines":[95],"local":[96,117,129],"search.":[100,113],"Local":[101],"used":[104,144],"reduce":[106],"In":[114],"this":[115,163],"paper,":[116],"treated":[120],"as":[121],"discrete":[123],"dynamical":[124],"system.":[125],"A":[126],"set":[127],"trajectories":[131],"converges":[132],"small":[134,148],"area":[135,149],"Then":[140],"solution.":[154],"global":[156],"optimization":[157],"features":[158],"complexity":[161],"system":[166],"are":[167],"also":[168],"discussed.":[169]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}