Internet Archive Scholar

Competitive Decision Algorithm for the Rooted Delay-constrained Minimum Spanning Tree

Xiaohua Xiong, Xuemin Chen, Aibing Ning
2013 Proceedings of the 2013 International Conference on Advanced Computer Science and Electronics Information   unpublished

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (1.2 MB)
https://web.archive.org/web/20200727232016/https://download.atlantis-press.com/article/6953.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.

In this paper, we investigate a rooted delayconstrained minimum spanning tree (RDCMST) problem. RDCMST seeks to find a minimum spanning tree in which no path from a specified root node to any other nodes may exceed a given delay bound. RDCMST is a NP-hard combinatorial optimization problem arising both in scientific research and practical engineering. Competitive decision algorithm (CDA) is a newly proposed meta-heuristic algorithm for solving complex combinatorial optimization problems. A new
more » ... DA algorithm for RDCMST problem is proposed in this paper. Restricted candidate list (RCL) and randomly choosing resource are introduced in CDA for the first time. We reduce the search space based on the mathematical properties of RDCMST. To evaluate the algorithm, numerical computational experiments are performed.
doi:10.2991/icaise.2013.19 fatcat:tcnqclpnhfag5echjhk3txzxue
Citation

Xiaohua Xiong, Xuemin Chen, Aibing Ning. "Competitive Decision Algorithm for the Rooted Delay-constrained Minimum Spanning Tree." Proceedings of the 2013 International Conference on Advanced Computer Science and Electronics Information (2013)