{"id":"https://openalex.org/W4385188348","doi":"https://doi.org/10.1145/3583133.3590575","title":"Simulated Annealing Algorithm for the Bounded Diameter Minimum Spanning Tree Problem","display_name":"Simulated Annealing Algorithm for the Bounded Diameter Minimum Spanning Tree Problem","publication_year":2023,"publication_date":"2023-07-15","ids":{"openalex":"https://openalex.org/W4385188348","doi":"https://doi.org/10.1145/3583133.3590575"},"language":"en","primary_location":{"id":"doi:10.1145/3583133.3590575","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583133.3590575","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion 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/A5100783747","display_name":"Hong Li","orcid":"https://orcid.org/0009-0007-3342-4538"},"institutions":[{"id":"https://openalex.org/I61057504","display_name":"Fujian Agriculture and Forestry University","ror":"https://ror.org/04kx2sy84","country_code":"CN","type":"education","lineage":["https://openalex.org/I61057504"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Li Hong","raw_affiliation_strings":["Fujian Agriculture and Forestry University, Fuzhou, China"],"affiliations":[{"raw_affiliation_string":"Fujian Agriculture and Forestry University, Fuzhou, China","institution_ids":["https://openalex.org/I61057504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031490906","display_name":"Yiwen Zhong","orcid":"https://orcid.org/0000-0002-9132-913X"},"institutions":[{"id":"https://openalex.org/I61057504","display_name":"Fujian Agriculture and Forestry University","ror":"https://ror.org/04kx2sy84","country_code":"CN","type":"education","lineage":["https://openalex.org/I61057504"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yiwen Zhong","raw_affiliation_strings":["Fujian Agriculture and Forestry University, Fuzhou, China"],"affiliations":[{"raw_affiliation_string":"Fujian Agriculture and Forestry University, Fuzhou, China","institution_ids":["https://openalex.org/I61057504"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069086838","display_name":"Juan K. Lin","orcid":"https://orcid.org/0000-0002-4279-6081"},"institutions":[{"id":"https://openalex.org/I61057504","display_name":"Fujian Agriculture and Forestry University","ror":"https://ror.org/04kx2sy84","country_code":"CN","type":"education","lineage":["https://openalex.org/I61057504"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Juan Lin","raw_affiliation_strings":["Fujian Agriculture and Forestry University, Fuzhou, China"],"affiliations":[{"raw_affiliation_string":"Fujian Agriculture and Forestry University, Fuzhou, China","institution_ids":["https://openalex.org/I61057504"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100783747"],"corresponding_institution_ids":["https://openalex.org/I61057504"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14489553,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"215","last_page":"218"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","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/T10551","display_name":"Scheduling and Optimization Algorithms","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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9959999918937683,"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/T12288","display_name":"Optimization and Search Problems","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.6423614621162415},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6133609414100647},{"id":"https://openalex.org/keywords/swap","display_name":"Swap (finance)","score":0.5748334527015686},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5628669261932373},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5169891119003296},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5097178816795349},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49442410469055176},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4654437303543091},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4381202459335327},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4243367612361908},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3984258770942688},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2705037593841553},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10801932215690613}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6423614621162415},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6133609414100647},{"id":"https://openalex.org/C99821215","wikidata":"https://www.wikidata.org/wiki/Q1136583","display_name":"Swap (finance)","level":2,"score":0.5748334527015686},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5628669261932373},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5169891119003296},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5097178816795349},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49442410469055176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4654437303543091},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4381202459335327},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4243367612361908},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3984258770942688},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2705037593841553},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10801932215690613},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","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},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"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/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3583133.3590575","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583133.3590575","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","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":10,"referenced_works":["https://openalex.org/W1507484587","https://openalex.org/W1965810411","https://openalex.org/W2072878203","https://openalex.org/W2078614936","https://openalex.org/W2094076493","https://openalex.org/W2101775461","https://openalex.org/W2156773695","https://openalex.org/W2166775052","https://openalex.org/W3046886974","https://openalex.org/W3177843672"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":{"The":[0,109,127],"bounded":[1],"diameter":[2,23],"minimum":[3,16],"spanning":[4,12],"tree":[5,13],"(BDMST)":[6],"problem":[7],"aims":[8],"at":[9],"obtaining":[10],"a":[11,30,51,61],"T":[14,25],"of":[15,24,40,77,106,113],"cost":[17,105],"under":[18],"the":[19,22,38,57,72,78,85,104,114,137],"constraint":[20],"that":[21,136],"is":[26,65,82,99,149],"no":[27],"greater":[28],"than":[29,144],"positive":[31],"integer":[32],"parameter.":[33],"In":[34,71],"order":[35],"to":[36,67,101],"increase":[37],"efficiency":[39,112],"creating":[41],"new":[42],"solutions":[43],"for":[44,56,152],"permutation-based":[45],"solution":[46],"representation,":[47],"this":[48],"paper":[49],"presents":[50],"Simulated":[52],"Annealing":[53],"(SA)":[54],"algorithm":[55,140],"BDMST":[58],"problem.":[59],"Specifically,":[60],"biased":[62,73,115],"swap":[63,74,80,116],"operator":[64,117],"designed":[66],"produce":[68],"neighbor":[69,107],"solutions.":[70,108],"operator,":[75],"one":[76],"two":[79],"positions":[81,91],"selected":[83],"by":[84,124],"K-tournament":[86],"selection":[87],"strategy,":[88],"where":[89],"smaller":[90],"are":[92,122],"preferred.":[93],"Furthermore,":[94],"an":[95],"accelerated":[96,119],"evaluation":[97,120],"strategy":[98,121],"proposed":[100,138],"efficiently":[102],"evaluate":[103],"effectiveness":[110],"and":[111,118,148],"verified":[123],"experimental":[125],"results.":[126],"comparison":[128],"carried":[129],"out":[130],"on":[131],"complete":[132],"Euclidean":[133],"graphs":[134],"shows":[135],"SA":[139],"performs":[141],"significantly":[142],"better":[143],"other":[145],"well-behaved":[146],"algorithms":[147],"especially":[150],"suitable":[151],"large-scale":[153],"instances.":[154]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}