Comparison of proposed algorithm to ant colony optimization algorithm to form a ring topology with minimum path value

A telecommunication network consists of some terminal, like nodes and link. In order to enable telecommunication between the terminal, the nodes should be connected by links. Many factors are considered in designing a network, such as the number of nodes, type, position network elements, and also routing information, the network planning process has several challenges from the optimization point. This issue is classified as NP-Hard. One practical example issue of this NP-hard is creating a ring topology for some nodes on optical network telecommunication. This issue known as Travelling Salesman Problem (TSP). In this paper, we are interested to propose an algorithm to solve the TSP. The goal of this algorithm is to find the minimal solution which is used to form a ring topology that have minimum weight/cost. To test the proposed algorithm, the results obtained compared with Ant Colony Optimization algorithm, both minimum value and computational time. From the test shown that the proposed algorithm is better than ACO. From the test with three different data, it can be concluded that for the number of nodes 20 until 50, the proposed algorithm has average 15% better than ACO to find minimal solution to solve TSP.