{"id":"https://openalex.org/W1971745944","doi":"https://doi.org/10.1145/1982185.1982421","title":"New hybrid genetic algorithm for solving optimal communication spanning tree problem","display_name":"New hybrid genetic algorithm for solving optimal communication spanning tree problem","publication_year":2011,"publication_date":"2011-03-21","ids":{"openalex":"https://openalex.org/W1971745944","doi":"https://doi.org/10.1145/1982185.1982421","mag":"1971745944"},"language":"en","primary_location":{"id":"doi:10.1145/1982185.1982421","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1982185.1982421","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 ACM Symposium on Applied Computing","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/A5044244767","display_name":"Pham Trung Kien","orcid":"https://orcid.org/0000-0003-3102-3355"},"institutions":[{"id":"https://openalex.org/I64519617","display_name":"Hanoi University","ror":"https://ror.org/01mxx0e62","country_code":"VN","type":"education","lineage":["https://openalex.org/I64519617"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Pham Trung Kien","raw_affiliation_strings":["Hanoi University of Technology, Ha Noi, Viet Nam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hanoi University of Technology, Ha Noi, Viet Nam","institution_ids":["https://openalex.org/I64519617"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087344608","display_name":"Nguyen Duy Hiep","orcid":null},"institutions":[{"id":"https://openalex.org/I64519617","display_name":"Hanoi University","ror":"https://ror.org/01mxx0e62","country_code":"VN","type":"education","lineage":["https://openalex.org/I64519617"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Nguyen Duy Hiep","raw_affiliation_strings":["Hanoi University of Technology, Ha Noi, Viet Nam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hanoi University of Technology, Ha Noi, Viet Nam","institution_ids":["https://openalex.org/I64519617"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072105691","display_name":"Hu\u1ef3nh Th\u1ecb Thanh B\u00ecnh","orcid":"https://orcid.org/0000-0003-1976-6113"},"institutions":[{"id":"https://openalex.org/I64519617","display_name":"Hanoi University","ror":"https://ror.org/01mxx0e62","country_code":"VN","type":"education","lineage":["https://openalex.org/I64519617"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Huynh Thi Thanh Binh","raw_affiliation_strings":["Hanoi University of Technology, Ha Noi, Viet Nam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hanoi University of Technology, Ha Noi, Viet Nam","institution_ids":["https://openalex.org/I64519617"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I64519617"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1076","last_page":"1081"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9984999895095825,"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.9984999895095825,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9944000244140625,"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.9939000010490417,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7040724754333496},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6471695899963379},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6054840087890625},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.6021571159362793},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.6008822321891785},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.589879035949707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.575599193572998},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.566094160079956},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5342793464660645},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5119262933731079},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4731111228466034},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.4682289958000183},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35002121329307556},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3162337839603424},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1644103229045868}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7040724754333496},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6471695899963379},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6054840087890625},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.6021571159362793},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.6008822321891785},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.589879035949707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.575599193572998},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.566094160079956},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5342793464660645},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5119262933731079},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4731111228466034},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.4682289958000183},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35002121329307556},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3162337839603424},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1644103229045868},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1982185.1982421","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1982185.1982421","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 ACM Symposium on Applied Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1351836516","display_name":"Tr\u00ed tu\u1ec7 t\u00ednh to\u00e1n: C\u00e1c k\u1ef9 thu\u1eadt ti\u1ebfn ho\u00e1, th\u00edch nghi, v\u00e0 d\u1ef1a tr\u00ean tri th\u1ee9c","funder_award_id":"102.01.14.09","funder_id":"https://openalex.org/F4320309617","funder_display_name":"National Foundation for Science and Technology Development"}],"funders":[{"id":"https://openalex.org/F4320309617","display_name":"National Foundation for Science and Technology Development","ror":"https://ror.org/04rw64z44"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1570927853","https://openalex.org/W1574175429","https://openalex.org/W1963500358","https://openalex.org/W1975266914","https://openalex.org/W1983265875","https://openalex.org/W1992339380","https://openalex.org/W2004711524","https://openalex.org/W2016218947","https://openalex.org/W2024833164","https://openalex.org/W2047517090","https://openalex.org/W2071380202","https://openalex.org/W2110786500","https://openalex.org/W2151924821","https://openalex.org/W2160067295"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2899787781","https://openalex.org/W2418231958","https://openalex.org/W2381121915","https://openalex.org/W2387385213","https://openalex.org/W2074214908","https://openalex.org/W4242086819","https://openalex.org/W2390742649","https://openalex.org/W2384589661","https://openalex.org/W2363076693"],"abstract_inverted_index":{"Optimal":[0],"Communication":[1],"Spanning":[2],"Tree":[3],"(OCST)":[4],"is":[5],"a":[6,40],"well-known":[7],"NP-hard":[8],"problem":[9],"on":[10,27],"the":[11,16,20,28,46,50,53,72,86],"graph":[12],"that":[13,82],"seeks":[14],"for":[15],"spanning":[17],"tree":[18,24],"with":[19,49,75,89],"lowest":[21],"cost.":[22],"The":[23,78],"cost":[25],"depends":[26],"demand":[29],"and":[30,92],"distance":[31],"between":[32],"each":[33,61],"pair":[34],"of":[35,52,65],"nodes.":[36],"This":[37],"paper":[38],"presents":[39],"Hybrid":[41],"Genetic":[42],"Algorithm":[43],"(HGA)":[44],"combining":[45],"basic":[47],"GA":[48],"ideas":[51],"Particle":[54],"Swarm":[55],"Optimization":[56],"(PSO)":[57],"algorithm.":[58],"In":[59],"HGA,":[60],"individual":[62],"exploits":[63],"information":[64],"its":[66],"own":[67],"experience":[68],"to":[69],"search":[70],"through":[71],"solution":[73],"space":[74],"genetic":[76],"operator.":[77],"experiment":[79],"results":[80],"show":[81],"our":[83],"HGA":[84],"outperforms":[85],"previous":[87],"GAs":[88],"faster":[90],"convergence":[91],"better":[93],"solution.":[94]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}