Performance Investigation of Heuristic and Metaheuristic Algorithm in Ring Topology Network Design
Tutun Juhana, Selvi Lukman, Fierda Kurniacahya, Nana Rachmana · International Journal on Engineering Applications (IREA) · 2025
Optimizing communication network is pivotal, as it is capable to reduce the network costs while providing its best efficiency, robustness and constants traffic distribution. Optimization process in network topologies is studied using the concept of Graph Theory of the Travelling Salesman Problem (TSP). The mathematical framework of TSP is derived into heuristic and metaheuristic technique. The heuristic approach solves optimization problems faster than other traditional techniques; meanwhile metaheuristic approach offers a higher level technique for a suitable solution in optimization issues when information is sparse. This paper investigates the performance of Genetic Algorithm (GA) and Ant Colony Optimization (ACO) in optimizing 142 nodes of Palapa Ring backbone network communication in Indonesia. The problem lies on the existence of cut vertex. The cut vertex must be thoroughly anticipated as removing any vertex would result a complete graph divided into two or more disconnected components or what so called partitions. Testing and results have shown that ACO is more superior to GA that can be observed with minimized trajectories path and fast execution time. Therefore, ACO can be implemented for designing a reliable coverage planning of Palapa ring national network topology in Indonesia.