Dili, Yusufiani Nurlinawati (2021) Penyelesaian masalah transportasi untuk mencari solusi dengan pendekatan Minimum Spanning Tree (MST) menggunakan Algoritma Kruskal dan Algoritma Prim. Diploma thesis, UIN Sunan Gunung Djati Bandung.
|
Text (COVER)
1_cover.pdf Download (67kB) | Preview |
|
|
Text (ABSTRAK)
2_abstrak.pdf Download (79kB) | Preview |
|
|
Text (DAFTAR ISI)
3_daftarisi.pdf Download (73kB) | Preview |
|
|
Text (BAB I)
4_bab1.pdf Download (145kB) | Preview |
|
Text (BAB II)
5_bab2.pdf Restricted to Registered users only Download (285kB) | Request a copy |
||
Text (BAB III)
6_bab3.pdf Restricted to Registered users only Download (223kB) | Request a copy |
||
Text (BAB IV)
7_bab4.pdf Restricted to Registered users only Download (1MB) | Request a copy |
||
Text (BAB V)
8_bab5.pdf Restricted to Registered users only Download (68kB) | Request a copy |
||
Text (DAFTAR PUSTAKA)
9_daftarpustaka.pdf Restricted to Registered users only Download (64kB) | Request a copy |
Abstract
INDONESIA : Penelitian ini membahas tentang penyelesaian masalah transportasi dengan pendekatan Minimum Spanning Tree (MST) menggunakan algoritma Kruskal dan algoritma Prim untuk mencari solusi optimal. Algoritma Kruskal dan algoritma Prim merupakan algoritma dalam teori graf untuk mencari Minimum Spanning Tree (MST). Langkah algoritma Kruskal yaitu mengurutkan biaya dari yang terkecil hingga terbesar. Selanjutnya, pilih biaya yang paling terkecil. Kemudian, lakukan perhitungan dengan melihat sumber persediaan dan permintaan di setiap tujuan sampai semuanya terpenuhi, sehingga terlihat bentuk Minimum Spanning Tree (MST) dari algoritma Kruskal. Sedangkan langkah algoritma Prim yaitu dengan memilih sembarang titik atau sumber. Selanjutnya, pilih active edge dengan biaya terkecil. Kemudian, lakukan perhitungan dengan melihat sumber persediaan dan permintaan di setiap tujuan sampai semuanya terpenuhi, sehingga terlihat bentuk Minimum Spanning Tree (MST) dari algoritma Prim. Bentuk dari Minimum Spanning Tree (MST) menghasilkan solusi yang optimal. Dari hasil penelitian ini, pendekatan Minimum Spanning Tree (MST) dengan algoritma Prim yang lebih unggul. ENGLISH : This study discusses solving transportation problems with the Minimum Spanning Tree (MST) approach using Kruskal's algorithm and Prim's algorithm to find optimal solutions. Kruskal's algorithm and Prim's algorithm are algorithms in graph theory to find the Minimum Spanning Tree (MST). The steps of Kruskal's algorithm are to sort the costs from highest to largest. Next, choose the highest cost. Then, do the calculations by looking at the source of supply and demand at each destination until everything is met, so that the Minimum Spanning Tree (MST) form of the Kruskal algorithm is seen. Meanwhile, the Prim algorithm step is to choose any point or source. Further, choose an active edge that costs forever. Thus, perform calculations by looking at the source of supply and demand at each destination until everything is met, so that the Minimum Spanning Tree (MST) form of the Prim algorithm is visible. The form of the Minimum Spanning Tree (MST) produces an optimal solution. From the results of this study, the Minimum Spanning Tree (MST) approach with the Prim algorithm is superior.
Item Type: | Thesis (Diploma) |
---|---|
Uncontrolled Keywords: | Minimum Spanning Tree (MST); Graf; Solusi Optimal; Algoritma Kruskal; Algoritma Prim. |
Subjects: | Applied mathematics Applied mathematics > Mathematical Optimization |
Divisions: | Fakultas Sains dan Teknologi > Program Studi Matematika |
Depositing User: | Yusufiani Nurlinawati Dili |
Date Deposited: | 16 Mar 2021 02:25 |
Last Modified: | 16 Mar 2021 02:25 |
URI: | https://digilib.uinsgd.ac.id/id/eprint/37823 |
Actions (login required)
View Item |