A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem

Thành, Phạm Đình; Bình, Huỳnh Thị Thanh; Dac, Do Dinh; Long, Nguyen Binh; Phong, Le Minh Hai

doi:10.1109/cec.2019.8790070

Cited by 10 publications

(5 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In recent years, there has been a growing interest in the class of minimum cost clustering graph problems such as the CluTSP, CluSPT, CluMRCT, and many others. For instance, the NP-hard CluSPT has recently been widely investigated in its theoretical aspects [15], not to mention many approximation algorithms have been developed to tackle this problem [16][17][18][19][20]. Another example is the CluMRCT, which is an NP-hard problem with numerous practical applications, especially in the field of network design, computational biology, and transportation [21][22][23].…”

Section: Related Workmentioning

confidence: 99%

Genetic algorithm based approach to solve the Clustered Steiner Tree Problem

et al. 2023

View full text Add to dashboard Cite

In a complex network application, a set of nodes might be partitioned into multiple local clusters with different functions, properties, or communication protocols, and the communication is restricted between nodes of the same cluster to maximize efficiency and other security concern. Thus, there has been a rise in network design problems with additional constraints regarding the clustering of vertices, one of them being Clustered Steiner Tree Problem -a variant of the Steiner Tree Problem. Recently, a heuristic-based algorithm was proposed to solve the problem. However, its obtained result is limited in terms of solution quality when applied to the problem in the Euclidean case. This paper proposes a Genetic Algorithm called Shortest-Path Genetic Algorithm for solving the CluSteiner. In the proposal, a permutation-based individual representation that reduces the dimensionality of chromosomes to the number of clusters is devised. The proposed algorithm can solve the problem in both Euclidean and non-Euclidean cases. Experiment results compared to existing works in the literature are analyzed in detail to prove the effectiveness of the proposed algorithm.

show abstract

Section: Related Workmentioning

confidence: 99%

Genetic algorithm based approach to solve the Clustered Steiner Tree Problem

et al. 2023

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

Genetic Algorithm based Approach to Solve the Clustered Steiner Tree Problem

Anh

Ban

Huynh

et al. 2022

Preprint

View full text Add to dashboard Cite

In a complex network application, a set of nodes might be partitioned into multiple local clusters with different functions, properties, or communication protocols, and the communication is restricted between nodes of the same cluster to maximize efficiency and other security concern. Thus, there has been a rise in network design problems with additional constraints regarding the clustering of vertices, one of them being Clustered Steiner Tree Problem - a variant of the Steiner Tree Problem. Recently, a heuristic-based algorithm was proposed to solve the problem. However, its obtained result is limited in terms of solution quality when applied to the problem in the Euclidean case. This paper proposes a Genetic Algorithm called Shortest-Path Genetic Algorithm for solving the CluSteiner. In the proposal, a permutation-based individual representation that reduces the dimensionality of chromosomes to the number of clusters is devised. The proposed algorithm can solve the problem in both Euclidean and non-Euclidean cases. Experiment results compared to existing works in the literature are analyzed in detail to prove the effectiveness of the proposed algorithm.

show abstract

“…Chen subsequently proposed another approximate algorithm that improved the performance ratio by 40% under the condition of distance metric satisfying the triangular inequality. Another NPhard variant of the general class of minimum cost clustered tree problem called Clustered Shortest-Path Tree Problem (CluSPT) has also been widely investigated in recent literature, under theoretical viewpoint [7] as well as developing approximation algorithms for this problem [4,19]. Following studies from Thanh et al suggested another approach for solving this class problem more effectively by adopting the evolutionary multitasking paradigm [18,20].…”

Section: Related Workmentioning

confidence: 99%

Multifactorial Evolutionary Algorithm For Clustered Minimum Routing Cost Problem

Trung

Thanh

Hieu

et al. 2019

Proceedings of the Tenth International Symposium on Information and Communication Technology - SoICT 2019

Self Cite

View full text Add to dashboard Cite

Minimum Routing Cost Clustered Tree Problem (CluMRCT) is applied in various fields in both theory and application. Because the CluMRCT is NP-Hard, the approximate approaches are suitable to find the solution for this problem. Recently, Multifactorial Evolutionary Algorithm (MFEA) has emerged as one of the most efficient approximation algorithms to deal with many different kinds of problems. Therefore, this paper studies to apply MFEA for solving CluMRCT problems. In the proposed MFEA, we focus on crossover and mutation operators which create a valid solution of CluM-RCT problem in two levels: first level constructs spanning trees for graphs in clusters while the second level builds a spanning tree for connecting among clusters. To reduce the consuming resources, we will also introduce a new method of calculating the cost of CluMRCT solution. The proposed algorithm is experimented on numerous types of datasets. The experimental results demonstrate the effectiveness of the proposed algorithm, partially on large instances. [12].Among those mentioned problems, CluMRCT is one of the most newly investigated problems. This problem has been formally formulated in [12]. Concretely, consider a connected, undirected graph G = (V , E, w) with nonnegative edge length function w :A spanning tree T of G is a clustered spanning tree if T can be cut into k subtrees by eliminating k − 1 edges such that each subtree is a spanning tree for only one cluster. The CluMRCT problem focuses on the routing cost, which is the sum of shortest path distance between any pairs of vertices given a clustered spanning tree T . The CluMRCT problem is finding on graph G a clustered spanning tree T having the minimum routing cost. One practical realization of this problem is in computer network application where the communication terminals are vertices, and they are partitioned into many clusters. The communication between those terminals are restricted within a cluster and only a few terminals can be connected to another cluster for maximizing efficiency and other security concerns. Solving CluMRCT is equivalent to facilitate the network architecture that consumes the minimum peer-to-peer communication resources.

show abstract

A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem

Cited by 10 publications

References 17 publications

Genetic algorithm based approach to solve the Clustered Steiner Tree Problem

Genetic algorithm based approach to solve the Clustered Steiner Tree Problem

Genetic Algorithm based Approach to Solve the Clustered Steiner Tree Problem

Multifactorial Evolutionary Algorithm For Clustered Minimum Routing Cost Problem

Contact Info

Product

Resources

About