Aplikasi Algoritma Floyd-Warshall untuk Mengoptimalkan Distribusi Listrik di PLN Kota Gorontalo

Authors

  • Susanti Usman Program Studi Matematika, Universitas Negeri Gorontalo
  • Ifan Wiranto Program Studi Teknik Elektro, Universitas Negeri Gorontalo
  • Nurwan Nurwan Program Studi Matematika, Universitas Negeri Gorontalo

DOI:

https://doi.org/10.55657/rmns.v1i1.24

Keywords:

Optimal Route, Electrical Distribution, Floyd-Warshall Algorithm

Abstract

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.

Downloads

Download data is not yet available.

References

J. Siang, "Matematika Diskrit dan Aplikasinya pada Ilmu Komputer Yogyakarta”, Yogyakarta: Andi, 2014.

S. Mardiyono, "Matematika Diskret", Yogyakarta, IKIP Yokyakarta, 1996.

G. Chartrand and L. Lesnia, "Grhaps And Digrhaps, 6rd Edition”, Chapman And Hall/CRC, London, 2016

T. Harju, "Graph Teory", Finland, 2012.

Z. Prasetyo, "Penerapan Algoritma Djikstra untuk Perutean Adaptif pada Jaringan Pendistribusian Air PDAM dikabupaten Demak", Semarang, Universitas negeri Semarang, 2013.

H. Ulfiana, "Optimasi Jaringan listrik dengan algoritma prim dan aplikasi program matlab", Semarang, Universitas Negeri Semarang, 2009.

D. Salaki, "Penentuan lintasan terpendek dari FMIPA ke Rektorat dan Fakultas lain di UNSRAT Manado menggunakan Algoritma Djikstra", Manado, Universitas Sam Ratulangi, 2011.

F. Uzzy dan M. Rofiq, "Penentuan Lintasan Terpendek Menuju Café di kota Malang Menggunakan Metode Bellman-Ford dengan Location Based Service Berbasis Android", Malang, 2014.

D. Novandi, "Perbandingan Algoritma Djikstra dan Algoritma Floyd-Warshall dalam penentuan lintasan terpendek (Single Pair Shortest Path)", Bandung, Institut Teknologi Bandung, 2007.

T. Cormen, et.al, "Introduction to Algorithm Third Edition", Massachusetts, 2009.

R. Munir, “Matematika Diskrit”, Bandung, Institut Teknologi Bandung, 2012.

R. Sedgewick and K. Wayne, 2014 "An Introduction to The Analysis of Algorithms, Second Edition", 2014.

Downloads

Published

14-03-2022

How to Cite

[1]
S. Usman, I. Wiranto, and N. Nurwan, “Aplikasi Algoritma Floyd-Warshall untuk Mengoptimalkan Distribusi Listrik di PLN Kota Gorontalo”, Res. Math. Nat. Sci., vol. 1, no. 1, pp. 47–53, Mar. 2022.

Similar Articles

You may also start an advanced similarity search for this article.