{"id":"https://openalex.org/W2082629204","doi":"https://doi.org/10.1145/1569901.1569953","title":"New heuristic and hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem","display_name":"New heuristic and hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem","publication_year":2009,"publication_date":"2009-07-08","ids":{"openalex":"https://openalex.org/W2082629204","doi":"https://doi.org/10.1145/1569901.1569953","mag":"2082629204"},"language":"en","primary_location":{"id":"doi:10.1145/1569901.1569953","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1569953","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"article","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/A5002378569","display_name":"Thanh Thi Huynh Binh","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":true,"raw_author_name":"Thanh Thi Huynh Binh","raw_affiliation_strings":["Ha Noi University of Technology, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"Ha Noi University of Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021669497","display_name":"Bob McKay","orcid":"https://orcid.org/0000-0003-3160-5822"},"institutions":[{"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":"Robert I. McKay","raw_affiliation_strings":["Seoul National University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088822298","display_name":"Nguy\u1ec5n Xu\u00e2n Ho\u00e0i","orcid":null},"institutions":[{"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":["Seoul National University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037667315","display_name":"Nguy\u1ec5n \u0110\u1ee9c Ngh\u0129a","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 Duc Nghia","raw_affiliation_strings":["Hanoi University of Technology, Hanoi, Vietnam","Hanoi University of Technology, Hanoi - Vietnam"],"affiliations":[{"raw_affiliation_string":"Hanoi University of Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I64519617"]},{"raw_affiliation_string":"Hanoi University of Technology, Hanoi - Vietnam","institution_ids":["https://openalex.org/I64519617"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5002378569"],"corresponding_institution_ids":["https://openalex.org/I94518387"],"apc_list":null,"apc_paid":null,"fwci":4.0161,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.93290294,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"373","last_page":"380"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9890999794006348,"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.9890999794006348,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9807999730110168,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T14304","display_name":"Transport Systems and Technology","score":0.9674999713897705,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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.7294249534606934},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.7206488251686096},{"id":"https://openalex.org/keywords/null-move-heuristic","display_name":"Null-move heuristic","score":0.6745845079421997},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6496673822402954},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5858473181724548},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5732487440109253},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5688775777816772},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.5524336099624634},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.507541298866272},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.498044490814209},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4965375065803528},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4622238874435425},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.4538038372993469},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41307318210601807},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.41283711791038513},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.3870971202850342},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19512802362442017},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.1544727385044098},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.14367201924324036},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.1198875904083252}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7294249534606934},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7206488251686096},{"id":"https://openalex.org/C114290370","wikidata":"https://www.wikidata.org/wiki/Q1415915","display_name":"Null-move heuristic","level":3,"score":0.6745845079421997},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6496673822402954},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5858473181724548},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5732487440109253},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5688775777816772},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.5524336099624634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.507541298866272},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.498044490814209},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4965375065803528},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4622238874435425},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.4538038372993469},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41307318210601807},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.41283711791038513},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.3870971202850342},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19512802362442017},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.1544727385044098},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.14367201924324036},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.1198875904083252},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1569901.1569953","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1569953","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W69139308","https://openalex.org/W194519168","https://openalex.org/W1480547862","https://openalex.org/W1498712363","https://openalex.org/W1507484587","https://openalex.org/W1510935138","https://openalex.org/W1574175429","https://openalex.org/W1574390288","https://openalex.org/W1977712294","https://openalex.org/W1983511657","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/W2101775461","https://openalex.org/W2115831664","https://openalex.org/W2140470303","https://openalex.org/W2140606557","https://openalex.org/W2142146559","https://openalex.org/W2151924821","https://openalex.org/W2163070614","https://openalex.org/W2166775052","https://openalex.org/W2169162059","https://openalex.org/W3004042307","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2381121915","https://openalex.org/W1561849181","https://openalex.org/W2387385213","https://openalex.org/W2390742649","https://openalex.org/W4380840098","https://openalex.org/W3016811403","https://openalex.org/W2418231958","https://openalex.org/W2384589661","https://openalex.org/W2943635264","https://openalex.org/W2899787781"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,39],"new":[6,36,46],"heuristic,":[7],"called":[8],"Center-Based":[9],"Recursive":[10],"Clustering":[11],"-":[12],"CBRC,":[13],"for":[14,58],"solving":[15],"the":[16,35,45,59,67,70],"bounded":[17],"diameter":[18],"minimum":[19],"spanning":[20],"tree":[21],"(BDMST)":[22],"problem.":[23],"Our":[24],"proposed":[25,71],"hybrid":[26],"genetic":[27,49,74],"algorithm":[28,50],"[12]":[29],"is":[30],"also":[31],"extended":[32],"to":[33],"include":[34],"heuristic":[37,47,72],"and":[38,48,61,73],"multi-parent":[40],"crossover":[41],"operator.":[42],"We":[43],"test":[44],"on":[51],"two":[52],"sets":[53],"of":[54,69],"benchmark":[55],"problem":[56],"instances":[57],"Euclidean":[60],"Non-Euclidean":[62],"cases.":[63],"Experimental":[64],"results":[65],"show":[66],"effectiveness":[68],"algorithm.":[75]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}