{"id":"https://openalex.org/W2587824540","doi":null,"title":"Solving Traveling Salesman Problem With a non-complete Graph","display_name":"Solving Traveling Salesman Problem With a non-complete Graph","alternate_titles":[],"publication_year":2010,"publication_date":"2010-01-07","ids":{"openalex":"https://openalex.org/W2587824540","mag":"2587824540"},"language":"en","primary_location":{"id":"pmh:oai:uwspace.uwaterloo.ca:10012/4906","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10012/4906","pdf_url":null,"source":{"id":"https://openalex.org/S4306401661","display_name":"UWSpace (University of Waterloo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I151746483","host_organization_name":"University of Waterloo","host_organization_lineage":["https://openalex.org/I151746483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Master Thesis"},"parent_works":[],"lineage":["https://openalex.org/W2587824540"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/10012/4906","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014091346","display_name":"Emami Taba","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Emami Taba","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5024555275","display_name":"Mahsa Sadat","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Mahsa Sadat","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":4,"reviewed_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9833999872207642,"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.9833999872207642,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.012199999764561653,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.00279999990016222,"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/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.9710000157356262},{"id":"https://openalex.org/keywords/shortest-path-algorithms","display_name":"shortest path algorithms","score":0.4230000078678131},{"id":"https://openalex.org/keywords/real-time-routing","display_name":"real-time routing","score":0.5820000171661377},{"id":"https://openalex.org/keywords/scalability","display_name":"scalability","score":0.6399999856948853},{"id":"https://openalex.org/keywords/np-hard-routing-problems","display_name":"NP-hard routing problems","score":0.5590000152587891}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8843013048171997},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5156673192977905},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.48615142703056335},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4802687168121338},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4515317380428314},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.4192866086959839},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.4147685170173645},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4102838635444641},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.387332946062088},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3210671842098236},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.283549427986145}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:uwspace.uwaterloo.ca:10012/4906","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10012/4906","pdf_url":null,"source":{"id":"https://openalex.org/S4306401661","display_name":"UWSpace (University of Waterloo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I151746483","host_organization_name":"University of Waterloo","host_organization_lineage":["https://openalex.org/I151746483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Master Thesis"},{"id":"mag:2587824540","doi":null,"is_oa":false,"landing_page_url":"https://uwspace.uwaterloo.ca/handle/10012/4906?show=full","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:uwspace.uwaterloo.ca:10012/4906","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10012/4906","pdf_url":null,"source":{"id":"https://openalex.org/S4306401661","display_name":"UWSpace (University of Waterloo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I151746483","host_organization_name":"University of Waterloo","host_organization_lineage":["https://openalex.org/I151746483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Master Thesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322676","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2587824540.pdf","grobid_xml":"https://content.openalex.org/works/W2587824540.grobid-xml"},"referenced_works_count":51,"referenced_works":["https://openalex.org/W41322358","https://openalex.org/W143070698","https://openalex.org/W155679527","https://openalex.org/W629225986","https://openalex.org/W1484040084","https://openalex.org/W1503222457","https://openalex.org/W1558547553","https://openalex.org/W1595882479","https://openalex.org/W1601649239","https://openalex.org/W1714357736","https://openalex.org/W1715975119","https://openalex.org/W1717440967","https://openalex.org/W1968594877","https://openalex.org/W1968686257","https://openalex.org/W1972755385","https://openalex.org/W1996833743","https://openalex.org/W1997403587","https://openalex.org/W2002425996","https://openalex.org/W2007199597","https://openalex.org/W2009803313","https://openalex.org/W2018689801","https://openalex.org/W2022179164","https://openalex.org/W2042986967","https://openalex.org/W2050819731","https://openalex.org/W2053567707","https://openalex.org/W2055370404","https://openalex.org/W2058748455","https://openalex.org/W2063836932","https://openalex.org/W2065714066","https://openalex.org/W2072526459","https://openalex.org/W2072605585","https://openalex.org/W2086917808","https://openalex.org/W2089929819","https://openalex.org/W2091299439","https://openalex.org/W2102076751","https://openalex.org/W2106378689","https://openalex.org/W2111563176","https://openalex.org/W2111581650","https://openalex.org/W2114552889","https://openalex.org/W2117226423","https://openalex.org/W2148673189","https://openalex.org/W2158999695","https://openalex.org/W2167469500","https://openalex.org/W2324108981","https://openalex.org/W2737411934","https://openalex.org/W2956015669","https://openalex.org/W2974328486","https://openalex.org/W3036211873","https://openalex.org/W3139666781","https://openalex.org/W3145128584","https://openalex.org/W7057874648"],"related_works":["https://openalex.org/W6941541123","https://openalex.org/W7097037311","https://openalex.org/W2145298150","https://openalex.org/W2916608448","https://openalex.org/W622819724","https://openalex.org/W2185027938","https://openalex.org/W2947290418","https://openalex.org/W2578972442","https://openalex.org/W2916878947","https://openalex.org/W2009648120"],"abstract_inverted_index":{"One":[0,34],"of":[1,23,28,130,145,167,202,235],"the":[2,10,16,30,38,51,106,133,138,156,160,170,210,218],"simplest,":[3],"but":[4],"still":[5],"NP-hard,":[6],"routing":[7],"problems":[8,140],"is":[9,19,64,95,119],"Traveling":[11],"Salesman":[12],"Problem":[13],"(TSP).":[14],"In":[15,54,136,192,226],"TSP,":[17],"one":[18],"given":[20,65],"a":[21,26,61,78,97,122,127,151,165,176,184,205,223],"set":[22,129],"cities":[24,44],"and":[25,47,239],"way":[27],"measuring":[29],"distance":[31],"between":[32],"cities.":[33],"has":[35],"to":[36,50,83,109,120,155,199],"find":[37,121],"shortest":[39,85],"tour":[40,107,125,179,236],"that":[41,60,173],"visits":[42],"all":[43,58,75,88],"exactly":[45],"once":[46],"returns":[48],"back":[49],"starting":[52],"city.":[53],"state-of-the-art":[55],"algorithms,":[56,212],"they":[57],"assume":[59],"complete":[62,79,134,161,171,206],"graph":[63,172],"as":[66],"an":[67],"input.":[68],"However,":[69],"for":[70,87,100,158],"very":[71],"large":[72],"graphs,":[73],"generating":[74,159],"edges":[76,131,146,168,203],"in":[77,112,116,132,150,169,175,204,222,233],"graph,":[80,186],"which":[81,143,187],"corresponds":[82],"finding":[84],"paths":[86],"city":[89],"pairs,":[90],"could":[91],"be":[92,110,148],"time-consuming.":[93],"This":[94],"definitely":[96],"major":[98],"obstacle":[99],"some":[101],"real-life":[102],"applications,":[103],"especially":[104],"when":[105],"needs":[108],"generated":[111],"real-time.":[113],"The":[114],"objective,":[115],"this":[117,193],"thesis,":[118,194],"near-optimal":[123,178],"TSP":[124,220,224],"with":[126,217],"reduced":[128],"graph.":[135,207],"particular,":[137],"following":[139],"are":[141,215],"investigated:":[142],"subset":[144,166],"can":[147],"produced":[149],"shorter":[152],"time":[153,157,238],"comparing":[154],"graph?":[162],"Is":[163],"there":[164],"results":[174],"better":[177],"than":[180],"other":[181],"sets?":[182],"With":[183],"non-complete":[185],"improvement":[188],"algorithms":[189,198,232],"work":[190],"better?":[191],"we":[195,229],"study":[196],"six":[197],"generate":[200],"subsets":[201],"To":[208],"evaluate":[209,230],"proposed":[211],"extensive":[213],"experiments":[214],"conducted":[216],"well-known":[219],"data":[221],"library.":[225],"these":[227,231],"experiments,":[228],"terms":[234],"quality,":[237],"scalability.":[240]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2587824540","counts_by_year":[{"year":2019,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2017-02-24T00:00:00"}
