{"id":"https://openalex.org/W1999598961","doi":"https://doi.org/10.1109/itng.2012.106","title":"Multilevel Graph Partitioning Scheme to Solve Traveling Salesman Problem","display_name":"Multilevel Graph Partitioning Scheme to Solve Traveling Salesman Problem","publication_year":2012,"publication_date":"2012-04-01","ids":{"openalex":"https://openalex.org/W1999598961","doi":"https://doi.org/10.1109/itng.2012.106","mag":"1999598961"},"language":"en","primary_location":{"id":"doi:10.1109/itng.2012.106","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itng.2012.106","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Ninth International Conference on Information Technology - New Generations","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/A5068731764","display_name":"Atif Ali Khan","orcid":"https://orcid.org/0000-0002-6006-2620"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Atif Ali Khan","raw_affiliation_strings":["School of Engineering, University of Warwick, Coventry, UK","School of Engineering, University of Warwick,Coventry,UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering, University of Warwick, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]},{"raw_affiliation_string":"School of Engineering, University of Warwick,Coventry,UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103015823","display_name":"Muhammad Umair Ahmad Khan","orcid":"https://orcid.org/0000-0002-9126-5594"},"institutions":[{"id":"https://openalex.org/I122274158","display_name":"Dalarna University","ror":"https://ror.org/000hdh770","country_code":"SE","type":"education","lineage":["https://openalex.org/I122274158"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Muhammad Umair Khan","raw_affiliation_strings":["Department of Computer Science, Dalarna University, Borlange, Sweden","Dept. of Comput. Sci., Dalarna Univ., Borlange, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Dalarna University, Borlange, Sweden","institution_ids":["https://openalex.org/I122274158"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Dalarna Univ., Borlange, Sweden","institution_ids":["https://openalex.org/I122274158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081855470","display_name":"Muneeb Iqbal","orcid":null},"institutions":[{"id":"https://openalex.org/I157227730","display_name":"University of East London","ror":"https://ror.org/057jrqr44","country_code":"GB","type":"education","lineage":["https://openalex.org/I157227730"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Muneeb Iqbal","raw_affiliation_strings":["The School of Architecture, Computing and Engineering, University of East London, UK","Sch. of Archit. Comput. & Eng., Univ. of East London, London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The School of Architecture, Computing and Engineering, University of East London, UK","institution_ids":["https://openalex.org/I157227730"]},{"raw_affiliation_string":"Sch. of Archit. Comput. & Eng., Univ. of East London, London, UK","institution_ids":["https://openalex.org/I157227730"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1433,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.73441376,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"458","last_page":"463"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9883000254631042,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9883000254631042,"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/T11106","display_name":"Data Management and Algorithms","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9858999848365784,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9392424821853638},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.7419909238815308},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.695430338382721},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.595178484916687},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.5650224089622498},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5543889403343201},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5360468029975891},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5325303077697754},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5277838110923767},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4617618918418884},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45986437797546387},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.42668527364730835},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.41304266452789307},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4067455530166626},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3330654203891754},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22615766525268555}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9392424821853638},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.7419909238815308},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.695430338382721},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.595178484916687},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.5650224089622498},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5543889403343201},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5360468029975891},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5325303077697754},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5277838110923767},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4617618918418884},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45986437797546387},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.42668527364730835},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.41304266452789307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4067455530166626},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3330654203891754},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22615766525268555},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itng.2012.106","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itng.2012.106","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Ninth International Conference on Information Technology - New Generations","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7599999904632568,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W187767610","https://openalex.org/W205113980","https://openalex.org/W576388822","https://openalex.org/W2055569927","https://openalex.org/W2120348968","https://openalex.org/W4210924444","https://openalex.org/W6608305153"],"related_works":["https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W4220987199","https://openalex.org/W2359992618","https://openalex.org/W2362402143","https://openalex.org/W2766731260","https://openalex.org/W2191054341","https://openalex.org/W2167244338","https://openalex.org/W1992470106"],"abstract_inverted_index":{"Traveling":[0,43],"salesman":[1,44,55,143],"problem":[2,45,56,62,69,90,105,144],"looks":[3],"simple":[4],"but":[5],"it":[6,64],"is":[7,30,46,58,78,99,136],"an":[8,133],"important":[9],"combinatorial":[10],"problem.":[11],"This":[12],"paper":[13],"proposes":[14],"a":[15,59],"new":[16],"hybrid":[17],"scheme":[18],"to":[19,39,66,87,140],"find":[20],"the":[21,36,40,67,74,88,94,103,118],"shortest":[22],"distance":[23],"of":[24,73,130],"tour":[25],"in":[26,149],"which":[27,84,101,138],"each":[28,111],"city":[29],"visited":[31],"exactly":[32],"one":[33,72],"time,":[34],"with":[35],"return":[37],"back":[38],"starting":[41],"city.":[42],"solved":[47],"using":[48,80],"multilevel":[49,81],"graph":[50,82],"partitioning":[51,83,97],"approach.":[52],"Although":[53],"traveling":[54],"itself":[57],"very":[60],"difficult":[61],"as":[63],"belongs":[65,86],"NP-Complete":[68,89],"class,":[70],"yet":[71],"best":[75],"possible":[76],"solution":[77,119,135],"proposed":[79],"also":[85],"class.":[91],"To":[92],"reduce":[93],"complexity,":[95],"k-mean":[96],"algorithm":[98],"used":[100,148],"divides":[102],"main":[104],"into":[106],"multiple":[107],"partitions.":[108],"Then":[109],"solving":[110],"partition":[112],"separately":[113],"and":[114,145,152],"thus":[115],"finally":[116],"improving":[117],"for":[120],"overall":[121],"tours":[122],"by":[123],"applying":[124],"Lin":[125],"Kernighan":[126],"algorithm.":[127],"From":[128],"all":[129],"this":[131],"analysis,":[132],"optimal":[134],"produced":[137],"tends":[139],"solve":[141],"travelling":[142],"could":[146],"be":[147],"more":[150],"advance":[151],"complex":[153],"applications.":[154]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}