Penyelesaian Masalah Transportasi Untuk Mencari Solusi Optimal Dengan Pendekatan Minimum Spanning Tree (Mst) Menggunakan Algoritma Kruskal Dan Algoritma Prim
DOI:
https://doi.org/10.15575/kubik.v6i1.13907Keywords:
Minimum Spanning Tree (MST), Graf, Solusi Optimal, Algoritma Kruskal, Algoritma PrimAbstract
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.
Â
References
Akpan and Iwok, "A Minimum Spanning Tree Approach of Solving a Transportation Problem," International Journal of Mathematics and Statistics Invention (IJMSI), vol. 5, no. 3, pp. 08-17, 2017
S. Johannes, Riset Operasi untuk pengambilan keputusan, Jakarta: Salemba empat, 1988
J. J. Siang, Riset Operasi dalam Pendekatan Algoritmis, Yogyakarta: C.V Andi Offset, 2011
R. Munir, Matematika Diskrit edisi ketiga revisi keempat, Bandung, 2010.
J. Erickson, Algorithms, USA: Department of Computer Science University of Illinois Urbana-Champaign, 2013.
Y. S. Kusumah, Matematika Diskrit, Bandung: CV. Andira, 1998.
J. J. Siang, Matematika Diskrit dan Aplikasinya Pada Ilmu Komputer, Yogyakarta: C.V Andi, 2002.
N. Girmay and T. Shaima, "Balance An Unbalanced Transportation Problem By A Heuristic Approach," International Journal of Mathematics and Its Applications (IJMAA), vol. 1, pp. 12-18, 2013.
K. Aljanabi and A. Jasim, "An Approach for Solving Transportation Problem Using Modified Kruskal's Algorithm," International Journal of Science and Research (IJSR), vol. 4, no. 7, 2015.
D. M. Alkubaisi, "Modified VOGEL Method to Find Initial Basic Feasible Solution (IBFS) Introduction a New Methodology to Find Best IBFS," Business and Management Research, vol. 4, no. 2, 2015.
A. Quddos, S. Javaid and M. Khalid, "A Revised Version of ASM-Method For Solving Transportation Problem," International Journal of Agricultural and Statistical Sciences, vol. 12, pp. 267-272, 2016.
Downloads
Published
How to Cite
Issue
Section
Citation Check
License
Authors who publish in KUBIK: Jurnal Publikasi Ilmiah Matematika agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
Â
