PENERAPAN ALGORITMA GREEDY DALAM MENENTUKAN MINIMUM SPANNING TREES PADA OPTIMISASI JARINGAN LISTRIK JALA

Authors

  • Didiharyono Didiharyono Universitas Andi Djemma Palopo
  • Siti Soraya STMIK Bumigora Mataram

DOI:

https://doi.org/10.30812/varian.v1i2.66

Keywords:

Greedy Algorithm, Minimum Spanning Trees, Nets Electricity Network

Abstract

This article discusses the applied of greedy algorithm principle in finding the optimum solution in determine minimum spanning tree on graph. Graph theory is one of the studies in discrete mathematics that are widely applied in various scope. This article is a literature study and applied of nets electricity network optimization using Prims algorithm and Kruskal algorithm. Network Nets System is one type of electrical network system construction. Based on results of the study and discussion can be concluded that the application of greedy algorithm using Prims algorithm and Kruskal algorithm in determine minimum spanning tree on its principle is the same. However, after a comparison between the two algorithms we consider that the ideal algorithm used to optimize the nets electric network is the Kruskal algorithm because in the case of the electric network has few sides and many vertices.

References

[1] Chartrand, Gary dan Zhang, Ping. (2004). Introduction to Graph Theory. New York: McGraw-Hill International.
[2] Emut. (2008). Aplikasi Algoritma Prime Dalam Menentukan Pohon Pembangkit Minimum Suatu Graf (Studi Kasus). Universitas Negeri Yogyakarta.
[3] Haryono, D., 2014. Filsafat Matematika. Bandung: Alfabeta.
[4] Jatiningsih, Trisni. (2010). Rancang Bangun Aplikasi Minimum Spanning Tree (MST) Menggunakan Algoritma Kruskal. Naskah Publikasi Jurnal Jurusan Teknik Informatika Sekolah Tinggi Manajemen Informatika dan Komputer (AMIKOM) Yogyakarta.
[5] Nugraha, D. W. (2011). Aplikasi algoritma prim untuk menentukan minimum spanning tree suatu graf berbobot dengan menggunakan pemrograman berorientasi objek. In FORISTEK: Forum Teknik Elektro dan Teknologi Informasi (Vol. 1, No. 2).
[6] Nugroho, Didit Budi. (2008). MX 324 Pengantar Teori Graf . Universitas Kristen Satya Wacana.
[7] Nugroho, Dwi Satio. (2015). Penerapan Algoritma Reverse Delete dalam Menentukan Minimum Spanning Tree Obyek Wisata Di Kota Yogyakarta. Universitas Islam Negeri Sunan Kalijaga.
[8] Rahmawati, Dian, and Ade Candra. (2013). Implementasi algoritma greedy untuk menyelesaikan masalah knapsack problem. Jurnal Ilmiah SAINTIKOM 12.
[9] Rosen, Kenneth. (2012). Discrete Mathematics and Its Applications. Seventh Edition. New York : McGrawHill Companies, Inc
[10] Syaputra, Aidil. (2012). Aplikasi Pohon Merentang (Spanning Tree) Dalam Pengoptimalan Jaringan Listrik. Makalah IF2091 Struktur Diskrit, Program Studi Teknik Informatika Sekolah Teknik Elektro dan Informatika Institut Teknologi Bandung.

Downloads

Published

2018-04-24

Issue

Vol. 1 No. 2 (2018)

Section

Articles

How to Cite

[1]
“PENERAPAN ALGORITMA GREEDY DALAM MENENTUKAN MINIMUM SPANNING TREES PADA OPTIMISASI JARINGAN LISTRIK JALA”, JV, vol. 1, no. 2, pp. 1–10, Apr. 2018, doi: 10.30812/varian.v1i2.66.

Most read articles by the same author(s)