Claim Missing Document
Check
Articles

Found 24 Documents
Search

Perbandingan Algoritma Kruskal dan Prim dalam Menentukan Minimum Spanning Tree untuk Optimasi Jaringan Distribusi Listrik Euis Sartika; Anie Lusiani
MUST: Journal of Mathematics Education, Science and Technology Vol 11 No 1 (2026): JULI
Publisher : Universitas Muhammadiyah Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30651/must.v11i1.28234

Abstract

This study aims to compare the performance of the Kruskal and Prim algorithms in solving the Minimum Spanning Tree (MST) problem for the PLN UP3 Cimahi electricity distribution network using Python-based Google Colab. The study employs an applied research methodology, utilising data on the lengths of electricity network cables modelled as a weighted graph. The analysis was carried out using the NetworkX library on Google Colab to construct the MST using both algorithms. The results show that both algorithms produced the same total MST weight of 1,258.05 metres, which is less than the initial network length of 1,424.61 metres, resulting in an efficiency of 11.69 per cent. Although they produced identical solutions, the Kruskal algorithm is simpler to apply to networks with a large number of nodes because the weight sorting process is carried out at the beginning. This study demonstrates that Google Colab is an effective platform for both learning and implementing graph theory-based network optimisation.
ALGORITMA KRUSKAL UNTUK MENYELESAIKAN MASALAH OPTIMASI DISTRIBUSI JARINGAN LISTRIK DI PLN UP3 CIMAHI Euis Sartika; Anie Lusiani; Ida Suhartini; Neneng Nuryati
EPSILON: JURNAL MATEMATIKA MURNI DAN TERAPAN Vol 18, No 2 (2024)
Publisher : Mathematics Study Program, Faculty of Mathematics and Natural Sciences, Lambung Mangkurat

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20527/epsilon.v18i2.13256

Abstract

The addition of new houses in the Kota Mas Cimahi housing complex has triggered an increase in the need for electricity distribution installations. To optimize the electricity distribution network, in this case minimizing the installation of electrical cables, an application is needed that can optimize the installation of electrical cables, namely the Kruskal algorithm which is an algorithm for finding the minimum spanning tree value on a weighted graph. In this study, two methods will be used, namely the manual method and the POM-QM for Windows software to help solve the minimum spanning tree problem. This study's goal is to identify the Kota Mas Cimahi housing complex's energy distribution network model's graph structure and determine a minimum spanning tree solution with POM-QM for Windows software and the Kruskal technique done by hand. In order to gather data for this study, PLN was the primary and secondary source Cimahi UP3. The distribution data for the electricity cable network is arranged in the form of a network image. By representing the electricity distribution network in the form of a graph, the minimum spanning tree is then obtained, and the solution to the MST (Minimum Spanning Tree) problem uses the Kruskal algorithm and TORA software. The results of the study showed that the minimum spanning tree cable length which was originally 1424.61 meters, after using the Kruskal algorithm manually became 1258.05 meters and also by using the POM-QM for Windows software obtained a minimum result of 1258.05 meters, so it can be concluded that there is a cable length efficiency of 11.69%.
Bellman-Ford Algorithm for Optimizing Drinking Water Distribution by Perumda Air Minum Tirta Raharja in Cicalengka Anie Lusiani; Euis Sartika; Neneng Nuryati; Hedi Hedi
KUBIK Vol 10 No 2 (2025): KUBIK: Jurnal Publikasi Ilmiah Matematika
Publisher : Department of Mathematics, Faculty of Science and Technology, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v10i2.48876

Abstract

Access to clean water in Cicalengka District, Bandung Regency, remains limited, with current coverage reaching only 5.08% of the population. Perumda Air Minum Tirta Raharja has set a target to expand drinking water service to 44% by 2030. To support this goal, this study investigates the optimization of the water distribution pipe network in Cicalengka. The research applies the Bellman-Ford algorithm to model the distribution network as a weighted, undirected, and connected graph, where customer houses are represented as vertices, pipe connections as edges, and pipe lengths as weights. Using data from the existing network and customer locations, the algorithm was implemented to identify optimal distribution paths. The results yielded two shortest path alternatives between the specified source and destination nodes. These findings demonstrate the potential of graph-based optimization in improving distribution planning and can serve as a reference for the development and management of future water supply infrastructure.
Bellman-Ford Algorithm for Optimizing Drinking Water Distribution by Perumda Air Minum Tirta Raharja in Cicalengka Anie Lusiani; Euis Sartika; Neneng Nuryati; Hedi Hedi
KUBIK Vol 10 No 2 (2025): KUBIK: Jurnal Publikasi Ilmiah Matematika
Publisher : Department of Mathematics, Faculty of Science and Technology, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v10i2.48876

Abstract

Access to clean water in Cicalengka District, Bandung Regency, remains limited, with current coverage reaching only 5.08% of the population. Perumda Air Minum Tirta Raharja has set a target to expand drinking water service to 44% by 2030. To support this goal, this study investigates the optimization of the water distribution pipe network in Cicalengka. The research applies the Bellman-Ford algorithm to model the distribution network as a weighted, undirected, and connected graph, where customer houses are represented as vertices, pipe connections as edges, and pipe lengths as weights. Using data from the existing network and customer locations, the algorithm was implemented to identify optimal distribution paths. The results yielded two shortest path alternatives between the specified source and destination nodes. These findings demonstrate the potential of graph-based optimization in improving distribution planning and can serve as a reference for the development and management of future water supply infrastructure.