Open AccessAplikasi Algoritma Floyd-Warshall untuk Mengoptimalkan Distribusi Listrik di PLN Kota Gorontalo
Author(s) -
Susanti Usman,
Ifan Wiranto,
Nurwan Nurwan
Publication year - 2022
Publication title -
research in the mathematical and natural sciences
Language(s) - English
Resource type - Journals
ISSN - 2828-6804
DOI - 10.55657/rmns.v1i1.24
Subject(s) - shortest path problem , graph , floyd–warshall algorithm , computer science , mathematics , combinatorics , dijkstra's algorithm
This research deals with the application of the Floyd-Warshall algorithm and Floyd-Warshall plus in the optimization of electricity distribution network routes in Gorontalo City. The route optimization begins by representing the power poles and cable lengths into a graph. The graph used is a weighted graph where the road (related to the length of the cable) is represented as a weighted side and the electric pole is represented as a point. This graph consists of a set of electric poles totalling 40 points and a set of roads (cable lengths) totalling 46 sides. The results showed that the shortest path of the electricity distribution network is and the minimum cable network length is 9,040 m.