{"id":"https://openalex.org/W2539214647","doi":"https://doi.org/10.1109/fskd.2016.7603158","title":"Genetic algorithms based on clustering for traveling salesman problems","display_name":"Genetic algorithms based on clustering for traveling salesman problems","publication_year":2016,"publication_date":"2016-08-01","ids":{"openalex":"https://openalex.org/W2539214647","doi":"https://doi.org/10.1109/fskd.2016.7603158","mag":"2539214647"},"language":"en","primary_location":{"id":"doi:10.1109/fskd.2016.7603158","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fskd.2016.7603158","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","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/A5014990292","display_name":"Li-Zhuang Tan","orcid":null},"institutions":[{"id":"https://openalex.org/I28006308","display_name":"Shandong Normal University","ror":"https://ror.org/01wy3h363","country_code":"CN","type":"education","lineage":["https://openalex.org/I28006308"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lizhuang Tan","raw_affiliation_strings":["School of Information Science and Engineering, Shandong Normal University, Jinan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Science and Engineering, Shandong Normal University, Jinan, China","institution_ids":["https://openalex.org/I28006308"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046523518","display_name":"Yanyan Tan","orcid":"https://orcid.org/0000-0001-5056-6019"},"institutions":[{"id":"https://openalex.org/I28006308","display_name":"Shandong Normal University","ror":"https://ror.org/01wy3h363","country_code":"CN","type":"education","lineage":["https://openalex.org/I28006308"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yanyan Tan","raw_affiliation_strings":["School of Information Science and Engineering, Shandong Normal University, Jinan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Science and Engineering, Shandong Normal University, Jinan, China","institution_ids":["https://openalex.org/I28006308"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067450688","display_name":"Guo-Xiao Yun","orcid":null},"institutions":[{"id":"https://openalex.org/I28006308","display_name":"Shandong Normal University","ror":"https://ror.org/01wy3h363","country_code":"CN","type":"education","lineage":["https://openalex.org/I28006308"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guoxiao Yun","raw_affiliation_strings":["School of Information Science and Engineering, Shandong Normal University, Jinan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Science and Engineering, Shandong Normal University, Jinan, China","institution_ids":["https://openalex.org/I28006308"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103423903","display_name":"Yan-Na Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I28006308","display_name":"Shandong Normal University","ror":"https://ror.org/01wy3h363","country_code":"CN","type":"education","lineage":["https://openalex.org/I28006308"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yanna Wu","raw_affiliation_strings":["School of Information Science and Engineering, Shandong Normal University, Jinan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Science and Engineering, Shandong Normal University, Jinan, China","institution_ids":["https://openalex.org/I28006308"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I28006308"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"103","last_page":"108"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9933000206947327,"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/T13535","display_name":"Wireless Sensor Networks and IoT","score":0.9814000129699707,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/cluster-analysis","display_name":"Cluster analysis","score":0.8520324230194092},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8217480182647705},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6447163224220276},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5814470052719116},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5421229004859924},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4929535388946533},{"id":"https://openalex.org/keywords/affinity-propagation","display_name":"Affinity propagation","score":0.4718206822872162},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45839723944664},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.4457401633262634},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3983851969242096},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.3272814452648163},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21058982610702515}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8520324230194092},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8217480182647705},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6447163224220276},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5814470052719116},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5421229004859924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4929535388946533},{"id":"https://openalex.org/C109659709","wikidata":"https://www.wikidata.org/wiki/Q3407504","display_name":"Affinity propagation","level":5,"score":0.4718206822872162},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45839723944664},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.4457401633262634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3983851969242096},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.3272814452648163},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21058982610702515},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fskd.2016.7603158","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fskd.2016.7603158","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"No poverty","id":"https://metadata.un.org/sdg/1","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1495084022","https://openalex.org/W1571087346","https://openalex.org/W1826740954","https://openalex.org/W1968594877","https://openalex.org/W1978101274","https://openalex.org/W2012061784","https://openalex.org/W2015164669","https://openalex.org/W2017708378","https://openalex.org/W2024060531","https://openalex.org/W2027977415","https://openalex.org/W2076539542","https://openalex.org/W2104670598","https://openalex.org/W2134089414","https://openalex.org/W2140425706","https://openalex.org/W2142661676","https://openalex.org/W2148736953","https://openalex.org/W2149523634","https://openalex.org/W2154929945","https://openalex.org/W2160534125","https://openalex.org/W2165232124","https://openalex.org/W3107939723","https://openalex.org/W6679849079"],"related_works":["https://openalex.org/W2245611357","https://openalex.org/W2358586643","https://openalex.org/W2794209582","https://openalex.org/W1528194447","https://openalex.org/W1975195692","https://openalex.org/W2567087402","https://openalex.org/W2065347048","https://openalex.org/W2362911195","https://openalex.org/W2023363400","https://openalex.org/W2897883632"],"abstract_inverted_index":{"Genetic":[0,16],"Algorithm":[1,17],"(GA)":[2],"is":[3,51,73,78,117],"an":[4,105],"effective":[5,106,160],"method":[6,108],"for":[7,22,98,133],"solving":[8],"Traveling":[9],"Salesman":[10],"Problems":[11],"(TSPs),":[12],"nevertheless,":[13],"the":[14,29,43,65,76,94,118,121,135,138],"Classical":[15],"(CGA)":[18],"performs":[19],"poor":[20],"effect":[21],"large-scale":[23],"traveling":[24],"salesman":[25],"problems.":[26],"For":[27],"conquering":[28],"problem,":[30],"this":[31],"paper":[32],"presents":[33],"two":[34,61],"improved":[35],"genetic":[36,140,148,169],"algorithms":[37,170],"based":[38,142,150],"on":[39,130,143,151],"clustering":[40,145,154,168],"to":[41,63,85,92,109],"find":[42,93],"best":[44],"results":[45,157,165],"of":[46,120,128,137],"TSPs.":[47],"The":[48],"main":[49],"process":[50],"clustering,":[52],"intra-group":[53],"evolution":[54],"operation":[55],"and":[56,75,147,161,174,178],"inter-group":[57],"connection.":[58],"Clustering":[59],"includes":[60],"methods":[62],"divide":[64],"large":[66],"scale":[67],"TSP":[68],"into":[69,114],"several":[70],"sub-problems.":[71],"One":[72],"k-means,":[74],"other":[77,167],"affinity":[79,152],"propagation":[80,153],"(AP).":[81],"Each":[82],"sub-problem":[83],"corresponds":[84],"a":[86,126],"group.":[87],"Then":[88],"we":[89,103,123],"use":[90],"GA":[91],"shortest":[95],"path":[96],"length":[97],"each":[99],"sub-problem.":[100],"At":[101],"last,":[102],"design":[104],"connection":[107],"combine":[110],"all":[111],"those":[112],"groups":[113],"one":[115],"which":[116],"result":[119],"problem.":[122],"trial":[124],"run":[125],"set":[127],"experiments":[129],"benchmark":[131],"instances":[132],"testing":[134],"performance":[136],"proposed":[139],"algorithm":[141,149],"k-means":[144],"(KGA)":[146],"(APGA).":[155],"Experimental":[156],"demonstrate":[158],"their":[159],"efficient":[162],"performances.":[163],"Comparing":[164],"with":[166],"show":[171],"that":[172],"KGA":[173],"APGA":[175],"are":[176],"competitive":[177],"efficient.":[179]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}