No abstract

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.

No abstract

No abstract