Abstract
Nowadays the ring topology has become a standard in network topology design, especially on optical networks. Finding the minimum cost to connect all the nodes to create a ring topology network is the challenge. This problem is known as the Travelling Salesman Problem (TSP). This paper proposed a heuristic algorithm to find minimum cost and minimum computation time in creating a ring topology. The proposed algorithm has 0,102% less accuracy than brute force for less than 15 nodes. This algorithm creates minimum values with an average 0,754% better than ant colony optimization (ACO) and 15,16% better than Sasha. This algorithm takes computation time faster than ACO and Bambang.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
