arrow
返回

Scatter search for the minimum leaf spanning tree problem

delete2022-09-01
delete0
PRE
AI
Y
Yogita Singh Kardam
K
Kamal Srivastava *
P
Pallavi Jain
R
Rafael Martı́
DOI:10.1016/j.cor.2022.105858delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Given an undirected connected graph G, the Minimum Leaf Spanning Tree Problem (MLSTP) consists in finding a spanning tree T of G with minimum number of leaves. This is an NP-hard problem with applications in communication and water supply networks. In this paper, we propose a heuristic algorithm to provide high quality solutions (spanning trees with low number of leaves) for an input graph. Our heuristic is based on the scatter search methodology, and it combines different elements to perform an efficient search of the solution space. In particular, it applies both randomized and deterministic strategies in the construction methods to generate an initial set of solutions. A combination method specifically designed for trees coupled with two local searches with a diversity evaluation function, provides a good balance between search intensification and diversification. Experiments conducted on a large set of graphs indicate that our algorithm is able to generate spanning trees with a lower number of leaves than previous methods. Additionally, it is able to match the optimal solution in most of the instances for which it is known, outperforming the existing methods.
Keyword:
Spanning tree
Metaheuristics
Scatter search

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
1.8W

机构

I
indian institute of technology (iit) - jodhpur
学者数:
856
论文数: 764
被引数: 2
I
indian institute of technology system (iit system)
学者数:
9.5W
论文数: 9.9W
被引数: 93
D
dayalbagh educational institute (dei)
学者数:
430
论文数: 354
被引数: 0
学者 查看更多机构
引用论文

引用论文

Sport Consumer Behaviour
err
IF0
err2016-07-18
err0
PREAI
errDaniel Funk; Daniel Funk; Kostas Alexandris; Heath McDonald
err分享
err收藏
学者 查看更多内容