Randomized Greedy algorithms (RGAs) are interesting approaches incorporating the random processes into the greedy algorithms to solve problems whose structures are not well understood as well as problems in combinator...
详细信息
ISBN:
(纸本)9781728121536
Randomized Greedy algorithms (RGAs) are interesting approaches incorporating the random processes into the greedy algorithms to solve problems whose structures are not well understood as well as problems in combinatorial optimization. This paper introduces a new algorithm that combines the major features of RGAs and shortest path tree algorithm (SPTA) to deal with the Clustered shortest-pathtree Problem (CluSPT). In our algorithm, SPTA is used to determine the shortestpathtree in each cluster while the combination between characteristics of the RGAs and search strategy of SPTA are used to construct the edges connecting clusters. To evaluate the performance of the algorithm, various types of Euclidean benchmarks are selected. The experimental results show the strengths of the proposed algorithm in comparison with some existing algorithms. We also analyze the influences of the parameters on the performance of the algorithm.
暂无评论