Brute Force Modification Algorithm for Ring Topology Network Optimization
Muhammad Ali Fahroni, Dwi Pratiwi, Ali Romadhoni, Nana Rahmana Syambas · 2021
In this era, technology is now growing so fast. Especially in the optical network site. In this paper, the aouthors focus about problem solving in Travelling Salesman Problem (TSP) using bruteforce algorithm that has been modificated. This Proposed Algorithm trying to get a better result from the original bruteforce its self using pyton. With bruteforce as a basic, this Proposed Algorithm can get more than 15 nodes, in other hand, bruteforce only be able to touch 15 nodes only. And this Proposed Algorithm can beat the original bruteforce in time almost 200 times better than original.