{"id":"https://openalex.org/W7152637488","doi":"https://doi.org/10.31577/cai_2025_6_1295","title":"An Improved Genetic Algorithm for Solving the Clustered Steiner Tree Problem","display_name":"An Improved Genetic Algorithm for Solving the Clustered Steiner Tree Problem","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7152637488","doi":"https://doi.org/10.31577/cai_2025_6_1295"},"language":null,"primary_location":{"id":"doi:10.31577/cai_2025_6_1295","is_oa":true,"landing_page_url":"https://doi.org/10.31577/cai_2025_6_1295","pdf_url":"https://www.cai.sk/ojs/index.php/cai/article/download/2025_6_1295/1384","source":{"id":"https://openalex.org/S4210200093","display_name":"Computing and Informatics","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing and Informatics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.cai.sk/ojs/index.php/cai/article/download/2025_6_1295/1384","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088123826","display_name":"T.A. Do","orcid":null},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Tuan-Anh Do","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037843488","display_name":"Ha-Bang Ban","orcid":"https://orcid.org/0000-0003-2241-5146"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Ha-Bang Ban","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082192728","display_name":"Dang-Hai Pham","orcid":null},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Dang-Hai Pham","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038646939","display_name":"Le Minh Tu","orcid":"https://orcid.org/0000-0002-4724-6126"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Le Minh Tu","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I94518387"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.57556461,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"44","issue":"6","first_page":"1295","last_page":"1295"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.2897000014781952,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.2897000014781952,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.17329999804496765,"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.07590000331401825,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8348000049591064},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6538000106811523},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5618000030517578},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5493000149726868},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5281999707221985},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4681999981403351}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8348000049591064},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6538000106811523},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5618000030517578},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5493000149726868},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5281999707221985},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4681999981403351},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46560001373291016},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4652999937534332},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42890000343322754},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.32899999618530273},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.31940001249313354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3125999867916107},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3050000071525574},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28619998693466187},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.257099986076355},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2535000145435333}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.31577/cai_2025_6_1295","is_oa":true,"landing_page_url":"https://doi.org/10.31577/cai_2025_6_1295","pdf_url":"https://www.cai.sk/ojs/index.php/cai/article/download/2025_6_1295/1384","source":{"id":"https://openalex.org/S4210200093","display_name":"Computing and Informatics","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing and Informatics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.31577/cai_2025_6_1295","is_oa":true,"landing_page_url":"https://doi.org/10.31577/cai_2025_6_1295","pdf_url":"https://www.cai.sk/ojs/index.php/cai/article/download/2025_6_1295/1384","source":{"id":"https://openalex.org/S4210200093","display_name":"Computing and Informatics","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing and Informatics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320319125","display_name":"Tr\u01b0\u1eddng \u0110\u1ea1i h\u1ecdc B\u00e1ch Khoa H\u00e0 N\u1ed9i","ror":"https://ror.org/04nyv3z04"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7152637488.pdf","grobid_xml":"https://content.openalex.org/works/W7152637488.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"a":[1,7,53,63,104,119],"complex":[2],"network":[3,32],"comprising":[4],"many":[5,96],"devices,":[6],"set":[8],"of":[9,41,44,55,154],"nodes":[10],"may":[11],"be":[12],"partitioned":[13],"into":[14],"multiple":[15],"local":[16,133],"clusters":[17],"with":[18,35],"distinct":[19],"functions,":[20],"properties,":[21],"or":[22,83],"communication":[23],"protocols.":[24],"Thus,":[25],"there":[26],"has":[27],"been":[28,62],"an":[29],"increase":[30],"in":[31,70,79,95,132,141],"design":[33],"problems":[34],"additional":[36],"constraints":[37],"regarding":[38],"the":[39,47,56,71,80,100,110,127,151,155],"clustering":[40],"vertices,":[42],"one":[43],"which":[45],"is":[46],"Clustered":[48,111],"Steiner":[49,57,112],"Tree":[50,58,113],"Problem":[51],"\u2013":[52],"variant":[54],"Problem.":[59,114],"There":[60],"have":[61],"few":[64],"studies":[65],"working":[66],"on":[67],"this":[68],"problem":[69],"literature,":[72],"but":[73],"they":[74],"either":[75],"solve":[76,109],"it":[77],"only":[78],"metric":[81,144],"case,":[82],"their":[84,90],"exploration":[85,122],"capability":[86],"remains":[87],"limited.":[88],"Therefore,":[89],"results":[91],"are":[92,146],"not":[93],"good":[94],"cases.":[97],"To":[98],"overcome":[99],"drawbacks,":[101],"we":[102],"propose":[103],"Priority-Based":[105],"Genetic":[106],"Algorithm":[107],"to":[108,125,138,149],"The":[115],"proposed":[116,156],"algorithm":[117],"maintains":[118],"balance":[120],"between":[121],"and":[123,136,143],"exploitation":[124],"prevent":[126],"search":[128],"from":[129],"getting":[130],"stuck":[131],"optima.":[134],"Experiments":[135],"comparisons":[137],"existing":[139],"works":[140],"non-metric":[142],"cases":[145],"carefully":[147],"conducted":[148],"prove":[150],"remarkable":[152],"performance":[153],"algorithm.":[157]},"counts_by_year":[],"updated_date":"2026-04-11T06:13:24.991567","created_date":"2026-04-10T00:00:00"}