{"id":"https://openalex.org/W2101775461","doi":"https://doi.org/10.1109/cec.2008.4631221","title":"A new hybrid Genetic Algorithm for solving the Bounded Diameter Minimum Spanning Tree problem","display_name":"A new hybrid Genetic Algorithm for solving the Bounded Diameter Minimum Spanning Tree problem","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2101775461","doi":"https://doi.org/10.1109/cec.2008.4631221","mag":"2101775461"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2008.4631221","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2008.4631221","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","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/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":["Department of Information Technology, Hanoi University of Technology, Hanoi, Vietnam","Dept. of Inf. Technol., Hanoi Univ. of Technol., Hanoi"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Hanoi University of Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I64519617"]},{"raw_affiliation_string":"Dept. of Inf. Technol., Hanoi Univ. of Technol., Hanoi","institution_ids":["https://openalex.org/I64519617"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088822298","display_name":"Nguy\u1ec5n Xu\u00e2n Ho\u00e0i","orcid":null},"institutions":[{"id":"https://openalex.org/I118373667","display_name":"Seoul National University of Science and Technology","ror":"https://ror.org/00chfja07","country_code":"KR","type":"education","lineage":["https://openalex.org/I118373667"]},{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Nguyen Xuan Hoai","raw_affiliation_strings":["School of Computer Science and Engineering, Seoul National Engineering, South Korea","[School of Computer Science & Engineering, Seoul National University, Korea]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Seoul National Engineering, South Korea","institution_ids":["https://openalex.org/I118373667"]},{"raw_affiliation_string":"[School of Computer Science & Engineering, Seoul National University, Korea]","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021669497","display_name":"Bob McKay","orcid":"https://orcid.org/0000-0003-3160-5822"},"institutions":[{"id":"https://openalex.org/I118373667","display_name":"Seoul National University of Science and Technology","ror":"https://ror.org/00chfja07","country_code":"KR","type":"education","lineage":["https://openalex.org/I118373667"]},{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"R.I. McKay","raw_affiliation_strings":["School of Computer Science and Engineering, Seoul National Engineering, South Korea","[School of Computer Science & Engineering, Seoul National University, Korea]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Seoul National Engineering, South Korea","institution_ids":["https://openalex.org/I118373667"]},{"raw_affiliation_string":"[School of Computer Science & Engineering, Seoul National University, Korea]","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3128","last_page":"3134"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9947999715805054,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9947999715805054,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9919999837875366,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9904000163078308,"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/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7770516276359558},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.7230561375617981},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6778672933578491},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.6009906530380249},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5967106223106384},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.567684531211853},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5600075721740723},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5437284111976624},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5216324925422668},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4611435532569885},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4210326373577118},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39391380548477173},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35237568616867065},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.267050564289093},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14464664459228516}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7770516276359558},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.7230561375617981},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6778672933578491},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.6009906530380249},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5967106223106384},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.567684531211853},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5600075721740723},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5437284111976624},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5216324925422668},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4611435532569885},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4210326373577118},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39391380548477173},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35237568616867065},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.267050564289093},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14464664459228516},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/cec.2008.4631221","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2008.4631221","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W69139308","https://openalex.org/W194519168","https://openalex.org/W1507484587","https://openalex.org/W1510935138","https://openalex.org/W1574175429","https://openalex.org/W1574390288","https://openalex.org/W1977712294","https://openalex.org/W2011039300","https://openalex.org/W2017927472","https://openalex.org/W2024315858","https://openalex.org/W2078614936","https://openalex.org/W2079911323","https://openalex.org/W2082810196","https://openalex.org/W2094076493","https://openalex.org/W2115831664","https://openalex.org/W2140470303","https://openalex.org/W2140606557","https://openalex.org/W2142146559","https://openalex.org/W2151924821","https://openalex.org/W2166775052","https://openalex.org/W2476096155","https://openalex.org/W4237981999","https://openalex.org/W4254899134","https://openalex.org/W4297922645","https://openalex.org/W6602784374","https://openalex.org/W6608042824","https://openalex.org/W6634512254","https://openalex.org/W6671393783","https://openalex.org/W6680573519"],"related_works":["https://openalex.org/W1561849181","https://openalex.org/W3187208706","https://openalex.org/W3081212354","https://openalex.org/W98489388","https://openalex.org/W3116169590","https://openalex.org/W1985149601","https://openalex.org/W3101281637","https://openalex.org/W1703428550","https://openalex.org/W1964611452","https://openalex.org/W2390742649"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"a":[3],"new":[4],"hybrid":[5],"genetic":[6],"algorithm":[7],"-":[8,12],"known":[9],"as":[10],"HGA":[11,28,45,68],"is":[13,46],"proposed":[14],"for":[15],"solving":[16],"the":[17,41,50,59,64],"Bounded":[18],"Diameter":[19],"Minimum":[20],"Spanning":[21],"Tree":[22],"(BDMST)":[23],"problem.":[24],"We":[25],"experiment":[26],"with":[27,71],"on":[29,63],"two":[30,53,73],"sets":[31],"of":[32],"benchmark":[33],"problem":[34,43,66],"instances,":[35,44],"both":[36],"Euclidean":[37,42],"and":[38],"Non-Euclidean.":[39],"On":[40],"shown":[47],"to":[48],"outperform":[49],"previous":[51],"best":[52],"Genetic":[54],"Algorithms":[55],"(GAs)":[56],"reported":[57],"in":[58],"BDMST":[60],"literature,":[61],"while":[62],"Non-Euclidean":[65],"instance,":[67],"performs":[69],"comparably":[70],"these":[72],"GAs.":[74]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}