arrow
返回

Population-based simulated annealing algorithm for the min-degree constrained minimum spanning tree problem

delete2025-02-01
delete2
PRE
AI
L
Liangcheng Wu
K
Kai Yang
Y
Yiwen Zhong
J
Juan K. Lin *
DOI:10.1016/j.swevo.2024.101791delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The min-degree constrained minimum spanning tree (md-MST) problem belongs to a subset of minimum spanning tree (MST) problem variants, imposing a minimum degree constraint for each node. This problem falls within the realm of NP-hard combinatorial optimization problem. In this study, we propose a population-based simulated annealing (PSA) algorithm for the md-MST problem. Initially, a clustering-based initialization with a priority for short edges is devised to define a relatively compact yet high-quality preliminary search space. Following this, three productive neighborhood operators are designed to manage local conformation construction, partial structure refinement, and elite solution information learning. These operators offer a versatile and expansive search space, complementing the subsequent local search process, effectively optimizing the solution. Alongside a global optimal information expansion and coordinated evolution framework, PSA uniformly and flexibly explores the solution space, reaching optimal solutions eventually. Extensive experiments conducted on four widely-used datasets comprising 105 benchmark instances demonstrate that PSA outperforms state-ofthe-art approaches in terms of precision. Specifically, PSA achieves 49 current known best and 41 new best values out of 105 instances.
Keyword:
Simulated annealing
Population-based
Min-degree constrained minimum spanning
tree
Combinatorial optimization

期刊

Swarm and Evolutionary Computation 封面图
Swarm and Evolutionary Computation
IF:
8.5
论文数:
2.2K
被引数:
1.0W

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
Sleep Disorders: Simple or Complex?
err2015-06-24
err0
PREAI
errMichael J. Thorpy; Stephen A. Brunton
err分享
err收藏
err分享
err收藏
学者 查看更多内容