arrow
返回

Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem

delete2021-07-08
delete6
PRE
AI
K
Kavita Singh *
S
Shyam Sundar
DOI:10.1007/s00500-021-05913-zdelete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The bounded diameter minimum spanning tree (BD-MST) problem seeks a spanning tree (T) of minimum weight on a given connected, undirected and edge-weighted graph subject to the diameter of T does not exceed D >= 2, where D is a given positive integer. The BD-MST problem isNP-hard problem and finds many real-world applications. In this paper, we propose an artificial bee colony (ABC) algorithm for the BD-MST problem. ABC algorithm is a swarm-based metaheuristic technique based on the intelligent foraging behavior of honeybees. The proposed ABC algorithm employs permutation encoding. To exploit this encoding structure, two neighborhood strategies that help ABC algorithm in faster convergence towards finding high quality solutions are applied. On a set of Euclidean and non-Euclidean benchmark instances for various diameter bounds, the proposed approach has been compared with state-of-the-art approaches. Computational results demonstrate the effectiveness of the proposed approach to the other extant approaches in the literature.
Keyword:
Spanning tree
Bounded-diameter
Swarm intelligence
Artificial bee colony algorithm
Permutation encoding
Neighborhood strategies
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Soft Computing 封面图
Soft Computing
IF:
2.5
论文数:
1.0W
被引数:
2.1W

机构

N
national institute of technology (nit system)
学者数:
4.0W
论文数: 3.7W
被引数: 31
引用论文

引用论文

err分享
err收藏
Global Think Tanks
err
IF0
err2020-02-19
err0
PREAI
errJames G. McGann; Laura C. Whelan
err分享
err收藏
学者 查看更多内容