Shortest-path problem solving in the installation of data/internet network using Apriori algorithm
Ali Akbar, Ike Putri Kusumawijaya, Nurul Adhayanti, Hendri Dwi Putra · 2017
Data network is something highly important in information development. The commonly occuring problem is how to connect every node or town to make it connected to the network. We develop a softaware tool for solving shortest-path problem with Apriori algorithm to solve problem in the shortest-path in the implementation of internet network. Based on the research results by comparing Apriori Algorithm to genetics, it is found that Apriori Algorithm has advantages from the distance side used. In this case, for an experiment of 10 urban points, a distance of 38 for genetic algorithm is found as compared to 29 using the apriori algorithm and the value increases when 200 points are experimented, resulting in a value of 5931 for genetic and 242.5 (for apriori). From this result, it can then be concluded that apriori algorithm has the advantage in the form of lesser distance than the genetic algorithm hence it can be expected to reduce the costs.