{"id":"https://openalex.org/W2924300655","doi":"https://doi.org/10.3233/jifs169939","title":"A multi-matching approximation algorithm for Symmetric Traveling Salesman Problem","display_name":"A multi-matching approximation algorithm for Symmetric Traveling Salesman Problem","publication_year":2019,"publication_date":"2019-03-26","ids":{"openalex":"https://openalex.org/W2924300655","doi":"https://doi.org/10.3233/jifs169939","mag":"2924300655"},"language":"en","primary_location":{"id":"doi:10.3233/jifs169939","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs169939","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Fuzzy 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/A5112425326","display_name":"Husain Naser","orcid":null},"institutions":[{"id":"https://openalex.org/I119050109","display_name":"Ahlia University","ror":"https://ror.org/006yvnr95","country_code":"BH","type":"education","lineage":["https://openalex.org/I119050109"]}],"countries":["BH"],"is_corresponding":false,"raw_author_name":"Husain Naser","raw_affiliation_strings":["College of Information Technology, Ahlia University, Manama, Bahrain"],"affiliations":[{"raw_affiliation_string":"College of Information Technology, Ahlia University, Manama, Bahrain","institution_ids":["https://openalex.org/I119050109"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015964082","display_name":"Wasan Awad","orcid":"https://orcid.org/0000-0001-7152-3480"},"institutions":[{"id":"https://openalex.org/I119050109","display_name":"Ahlia University","ror":"https://ror.org/006yvnr95","country_code":"BH","type":"education","lineage":["https://openalex.org/I119050109"]}],"countries":["BH"],"is_corresponding":false,"raw_author_name":"Wasan S. Awad","raw_affiliation_strings":["College of Information Technology, Ahlia University, Manama, Bahrain"],"affiliations":[{"raw_affiliation_string":"College of Information Technology, Ahlia University, Manama, Bahrain","institution_ids":["https://openalex.org/I119050109"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057893924","display_name":"El-Sayed M. El-Alfy","orcid":"https://orcid.org/0000-0001-6279-9776"},"institutions":[{"id":"https://openalex.org/I134085113","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163","country_code":"SA","type":"education","lineage":["https://openalex.org/I134085113"]}],"countries":["SA"],"is_corresponding":true,"raw_author_name":"El-Sayed M. El-Alfy","raw_affiliation_strings":["Department of Information and Computer Science, College of Computer Sciences and Engineering King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computer Science, College of Computer Sciences and Engineering King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia","institution_ids":["https://openalex.org/I134085113"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057893924"],"corresponding_institution_ids":["https://openalex.org/I134085113"],"apc_list":null,"apc_paid":null,"fwci":0.4351,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.69120661,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"36","issue":"3","first_page":"2285","last_page":"2295"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994000196456909,"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.9994000196456909,"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.9983999729156494,"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/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.895695686340332},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6388022899627686},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6090785264968872},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5449151396751404},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4688219726085663},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4459281861782074},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3894406259059906}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.895695686340332},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6388022899627686},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6090785264968872},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5449151396751404},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4688219726085663},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4459281861782074},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3894406259059906},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/jifs169939","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs169939","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Fuzzy Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322323","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W389527589","https://openalex.org/W1488397247","https://openalex.org/W1572130003","https://openalex.org/W1826740954","https://openalex.org/W2055569927","https://openalex.org/W2069024107","https://openalex.org/W2112761664","https://openalex.org/W2112899894","https://openalex.org/W2123241324","https://openalex.org/W2149437250","https://openalex.org/W2154929945","https://openalex.org/W2163428398","https://openalex.org/W2164424155","https://openalex.org/W2164866963","https://openalex.org/W2213244149","https://openalex.org/W2239307921","https://openalex.org/W2299454783","https://openalex.org/W2330201086","https://openalex.org/W2334759282","https://openalex.org/W2503459740","https://openalex.org/W2552854184","https://openalex.org/W2748032639","https://openalex.org/W4242361212","https://openalex.org/W4246219036","https://openalex.org/W4254582216","https://openalex.org/W6605561933","https://openalex.org/W6676672126","https://openalex.org/W6681706933"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2054495636","https://openalex.org/W3157689847","https://openalex.org/W2164188042","https://openalex.org/W4306878646","https://openalex.org/W2046552997","https://openalex.org/W4376138746","https://openalex.org/W2495211334"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,18,95],"deterministic":[4],"algorithm":[5,72,92,107],"for":[6,121],"approximating":[7],"the":[8,11,28,61,64,68,74,80,83,105,113,128,135],"solution":[9,51],"of":[10,32,44,63,104,134],"Symmetric":[12],"Traveling":[13],"Salesman":[14],"Problem":[15],"(STSP)":[16],"using":[17,124],"multi":[19],"perfect":[20],"matching":[21],"and":[22,78,110],"partitioning":[23],"technique.":[24],"Initially,":[25],"we":[26],"find":[27],"minimum":[29,84],"cost":[30,86],"collection":[31],"sub-tours":[33,99],"that":[34,39,143],"cover":[35],"all":[36],"cities,":[37],"such":[38],"each":[40],"sub-tour":[41,66],"consi":[42],"sts":[43],"at":[45],"least":[46],"four":[47],"edges.":[48],"The":[49,71,91,102,132],"obtained":[50,116],"is":[52,60,100,108],"then":[53],"partitioned":[54,89],"into":[55],"k":[56,59],"branches,":[57],"where":[58],"length":[62],"smallest":[65],"in":[67,76,139,151],"resulting":[69,85],"solution.":[70],"solves":[73],"sub-problems":[75],"parallel":[77],"selects":[79],"sub-problem":[81],"with":[82,112],"to":[87],"be":[88],"further.":[90],"converges":[93],"when":[94],"complete":[96],"cycle":[97],"without":[98],"found.":[101],"performance":[103],"proposed":[106],"evaluated":[109],"compared":[111],"optimal":[114],"values":[115],"by":[117],"some":[118],"well-known":[119],"algorithms":[120],"solving":[122],"STSP":[123],"24":[125],"instances":[126],"from":[127],"TSPLIB":[129],"online":[130],"library.":[131],"results":[133],"experiments":[136],"carried":[137],"out":[138],"this":[140],"study":[141],"show":[142],"our":[144],"approach":[145],"yields":[146],"optimum":[147],"or":[148],"near-optimum":[149],"solutions":[150],"polynomial":[152],"execution":[153],"time.":[154]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}