{"id":"https://openalex.org/W2771707926","doi":"https://doi.org/10.1109/smc.2017.8122633","title":"Using k-means clustering to improve the efficiency of ant colony optimization for the traveling salesman problem","display_name":"Using k-means clustering to improve the efficiency of ant colony optimization for the traveling salesman problem","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2771707926","doi":"https://doi.org/10.1109/smc.2017.8122633","mag":"2771707926"},"language":"en","primary_location":{"id":"doi:10.1109/smc.2017.8122633","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2017.8122633","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","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/A5008771594","display_name":"Yen-Ching Chang","orcid":"https://orcid.org/0000-0002-8416-666X"},"institutions":[{"id":"https://openalex.org/I91279580","display_name":"Chung Shan Medical University","ror":"https://ror.org/059ryjv25","country_code":"TW","type":"education","lineage":["https://openalex.org/I91279580"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Yen-Ching Chang","raw_affiliation_strings":["Department of Medical Informatics, Chung Shan Medical University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Medical Informatics, Chung Shan Medical University","institution_ids":["https://openalex.org/I91279580"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008771594"],"corresponding_institution_ids":["https://openalex.org/I91279580"],"apc_list":null,"apc_paid":null,"fwci":0.2768,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.57216948,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":null,"first_page":"379","last_page":"384"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.995199978351593,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.993399977684021,"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.8791717886924744},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8456553220748901},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7571463584899902},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5972920656204224},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5526745915412903},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3081434965133667},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24938029050827026}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8791717886924744},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8456553220748901},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7571463584899902},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5972920656204224},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5526745915412903},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3081434965133667},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24938029050827026}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smc.2017.8122633","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2017.8122633","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6000000238418579,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1492640216","https://openalex.org/W1547053391","https://openalex.org/W1981472769","https://openalex.org/W2004186912","https://openalex.org/W2065327530","https://openalex.org/W2107941094","https://openalex.org/W2118573797","https://openalex.org/W2154929945","https://openalex.org/W2167920923","https://openalex.org/W2297395784","https://openalex.org/W2339005802","https://openalex.org/W4299796063","https://openalex.org/W6697634807"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W4385871958","https://openalex.org/W4245157707","https://openalex.org/W1997193297","https://openalex.org/W2908391583","https://openalex.org/W2369428395","https://openalex.org/W2981400081","https://openalex.org/W2495211334"],"abstract_inverted_index":{"Ant":[0],"colony":[1],"optimization":[2,8],"(ACO)":[3],"is":[4,81,94],"a":[5,111,153],"quite":[6],"mature":[7],"algorithm":[9],"for":[10,59],"combinational":[11],"problems,":[12],"but":[13],"it":[14],"still":[15],"attracts":[16],"many":[17],"researchers":[18],"trying":[19],"to":[20,30,49,53,76,84,96,131,148],"raise":[21],"its":[22],"efficiency":[23,56],"and/or":[24],"performance.":[25],"Some":[26],"of":[27,41,57,87,121,135,156],"them":[28],"endeavor":[29],"speed":[31],"up":[32],"or":[33,43,72],"improve":[34],"ACO":[35,58,80],"by":[36,125,139],"choosing":[37],"more":[38,73],"suitable":[39],"parameters":[40],"iteration":[42],"update":[44],"formulas.":[45],"This":[46],"work":[47],"tries":[48],"introduce":[50],"\u039b-means":[51,77,126],"clustering":[52,127],"enhance":[54],"the":[55,60,65,118,136,140,150],"traveling":[61],"salesman":[62],"problem.":[63],"First,":[64],"city":[66],"locations":[67],"are":[68,103,108],"clustered":[69],"into":[70,110],"two":[71,101],"groups":[74,86,102,107,123,146],"according":[75],"clustering.":[78],"Second,":[79],"separately":[82],"applied":[83],"these":[85,98],"cities.":[88,157],"Finally,":[89],"an":[90],"appropriate":[91],"connection":[92],"technique":[93],"used":[95],"join":[97],"groups;":[99],"every":[100],"connected":[104,109],"until":[105],"all":[106],"single":[112],"route.":[113],"Experimental":[114],"results":[115],"show":[116],"that":[117],"computational":[119],"cost":[120],"multiple":[122,145],"divided":[124],"can":[128],"be":[129],"reduced":[130],"below":[132],"32":[133],"percent":[134],"time":[137],"run":[138],"original":[141],"group,":[142],"and":[143],"even":[144],"contribute":[147],"raising":[149],"performance":[151],"in":[152],"particular":[154],"distribution":[155]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}