{"id":"https://openalex.org/W3036313076","doi":"https://doi.org/10.1080/17445760.2020.1776867","title":"A polynomial-time deterministic approach to the travelling salesperson problem","display_name":"A polynomial-time deterministic approach to the travelling salesperson problem","publication_year":2020,"publication_date":"2020-06-18","ids":{"openalex":"https://openalex.org/W3036313076","doi":"https://doi.org/10.1080/17445760.2020.1776867","mag":"3036313076"},"language":"en","primary_location":{"id":"doi:10.1080/17445760.2020.1776867","is_oa":false,"landing_page_url":"https://doi.org/10.1080/17445760.2020.1776867","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1744-5760","issn":["1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel, Emergent and Distributed Systems","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/A5015456283","display_name":"Ali Jazayeri","orcid":"https://orcid.org/0000-0002-6468-1971"},"institutions":[{"id":"https://openalex.org/I72816309","display_name":"Drexel University","ror":"https://ror.org/04bdffz58","country_code":"US","type":"education","lineage":["https://openalex.org/I72816309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ali Jazayeri","raw_affiliation_strings":["College of Computing and Informatics, Drexel University, Philadelphia, PA, USA"],"raw_orcid":"https://orcid.org/0000-0002-6468-1971","affiliations":[{"raw_affiliation_string":"College of Computing and Informatics, Drexel University, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I72816309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052717630","display_name":"Hiroki Sayama","orcid":"https://orcid.org/0000-0002-2670-5864"},"institutions":[{"id":"https://openalex.org/I123946342","display_name":"Binghamton University","ror":"https://ror.org/008rmbt77","country_code":"US","type":"education","lineage":["https://openalex.org/I123946342"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hiroki Sayama","raw_affiliation_strings":["Department of Systems Science and Industrial Engineering, Binghamton University, State University of New York, NY, USA"],"raw_orcid":"https://orcid.org/0000-0002-2670-5864","affiliations":[{"raw_affiliation_string":"Department of Systems Science and Industrial Engineering, Binghamton University, State University of New York, NY, USA","institution_ids":["https://openalex.org/I123946342"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015456283"],"corresponding_institution_ids":["https://openalex.org/I72816309"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.08730083,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"35","issue":"4","first_page":"454","last_page":"460"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983999729156494,"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.9912999868392944,"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.9771000146865845,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7605610489845276},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6834056377410889},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.5876646637916565},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.568389356136322},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5644044876098633},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5586865544319153},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5382205843925476},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5207021832466125},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5195746421813965},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46462708711624146},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.445658415555954},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43364953994750977},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4250063896179199}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7605610489845276},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6834056377410889},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.5876646637916565},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.568389356136322},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5644044876098633},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5586865544319153},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5382205843925476},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5207021832466125},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5195746421813965},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46462708711624146},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.445658415555954},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43364953994750977},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4250063896179199},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/17445760.2020.1776867","is_oa":false,"landing_page_url":"https://doi.org/10.1080/17445760.2020.1776867","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1744-5760","issn":["1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel, Emergent and Distributed Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6499999761581421}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W187767610","https://openalex.org/W1482722110","https://openalex.org/W1566652554","https://openalex.org/W1575155528","https://openalex.org/W1717440967","https://openalex.org/W2009803313","https://openalex.org/W2022931717","https://openalex.org/W2055569927","https://openalex.org/W2063160149","https://openalex.org/W2163428398","https://openalex.org/W2912127016"],"related_works":["https://openalex.org/W2031913815","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W4297427155","https://openalex.org/W803550684","https://openalex.org/W2007032764","https://openalex.org/W2483226803","https://openalex.org/W3143937874","https://openalex.org/W3136451934","https://openalex.org/W3025823153"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,28,58,60,95],"new":[3],"polynomial-time":[4],"deterministic":[5],"algorithm":[6,19,104,123,139],"that":[7,74],"produces":[8,124],"an":[9,147],"approximated":[10],"solution":[11],"for":[12,151],"the":[13,45,51,80,90,102,110,121],"travelling":[14],"salesperson":[15],"problem.":[16],"The":[17,98,137],"proposed":[18,103,122,138],"ranks":[20],"cities":[21,41,46,91],"based":[22,64],"on":[23,65],"their":[24,37,48,54,66,77],"priorities":[25,68],"calculated":[26,69],"using":[27],"power":[29,72],"function":[30,73],"of":[31,36,53,101,112],"means":[32],"and":[33,42],"standard":[34],"deviations":[35],"distances":[38],"from":[39,79],"other":[40,132,152],"then":[43],"connects":[44],"to":[47,83],"neighbours":[49],"in":[50],"order":[52],"priorities.":[55],"When":[56],"connecting":[57],"city,":[59],"neighbour":[61],"is":[62,105,109],"selected":[63],"neighbours'":[67],"as":[70,146],"another":[71],"additionally":[75],"includes":[76],"distance":[78],"focal":[81],"city":[82],"be":[84,141],"connected.":[85],"This":[86],"repeats":[87],"until":[88],"all":[89],"are":[92],"connected":[93],"into":[94],"single":[96],"loop.":[97],"time":[99,129],"complexity":[100,130],"O(n2),":[106],"where":[107],"n":[108],"number":[111],"cities.":[113],"Numerical":[114],"evaluation":[115],"shows":[116],"that,":[117],"despite":[118],"its":[119],"simplicity,":[120],"shorter":[125],"tours":[126],"with":[127],"less":[128],"than":[131],"conventional":[133],"tour":[134,149],"construction":[135],"heuristics.":[136],"can":[140],"used":[142],"by":[143],"itself":[144],"or":[145],"initial":[148],"generator":[150],"more":[153],"complex":[154],"heuristic":[155],"optimisation":[156],"algorithms.":[157]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}