Penerapan Matching pada Graf untuk Pendistribusian Pupuk Bersubsidi dengan Metode Hungarian

  • Eva Wahyu Listyawati Universitas Islam Darul 'Ulum Lamongan
  • Siti Amiroch Universitas Islam Darul 'Ulum Lamongan
  • Novita Eka Chandra Universitas Islam Darul 'Ulum Lamongan
DOI: https://doi.org/10.52166/ujmc.v6i01.2387
Keywords: Matching on the Graph, Subsidized Fertilizer, Hungarian Method

Abstract

Increasing yields, demanding each farmer to improve the quality of agriculture, which in turn is expected to increase profits. The purpose of this paper is to determine the allocation of subsidized fertilizer distribution by the distributor of PT. Anak Gresik Raya Kencana and looking for the maximum number of subsidized fertilizer needs distributed in Lamongan district each year so that there is no scarcity and HET (Highest Retail Price) does not increase by applying the hungarian method. In this case, the problem is expressed as a bipartite graph, especially a complete weighted bipartite graph that applies the concept of matching, which is a perfect matching search with maximum weight using the Hungarian method. Matching is said to be perfect if it has fulfilled all the sets of vertices X and Y. Obtained the results of the allocation of subsidized fertilizer distribution by the distributor of PT. Anak Gresik Raya Kencana is Deket sub-district requiring 1220 tons of SP-36, Glagah sub-district requires 3208 tons of Urea, Karangbinangun sub-district requires 483 tons of Organic, mantup sub-district requires 2079 tons of ZA, middle district needs 2233 tons of NPK and fertilizer distribution problems subsidized in Lamongan district can be completed with the maximum amount of subsidized fertilizer needs distributed as many as 9223 tons every year

References

[1] A. Rohmatullah, D. Rahmalia, and M. S. Pradana, “Klasterisasi Data Pertanian di Kabupaten Lamongan Menggunakan Algoritma K-Means Dan Fuzzy C Means,” J. Ilm. Teknosains, vol. 5, no. 2, pp. 86–93, 2019.
[2] M. S. Pradana, D. Rahmalia, and E. D. A. Prahastini, “Peramalan Nilai Tukar Petani Kabupaten Lamongan dengan Arima,” J. Mat., vol. 10, no. 2, pp. 91–104, 2020.
[3] D. Harini, “Optimasi Penugasan Menggunakan Metode Hungarian,” INTENSIF J. Ilm. Penelit. dan Penerapan Teknol. Sist. Inf., vol. 1, no. 2, pp. 68–74, 2017.
[4] M. Abrori and R. Wahyuningsih, “Penentuan Matching Maksimum Pada Graf Bipartit Berbobot Menggunakan Metode Hungarian,” J. Ilm. Tek. Ind., vol. 11, no. 1, pp. 9–21, 2012.
Published
2020-06-30
How to Cite
Listyawati, E., Amiroch, S., & Chandra, N. (2020). Penerapan Matching pada Graf untuk Pendistribusian Pupuk Bersubsidi dengan Metode Hungarian. UJMC (Unisda Journal of Mathematics and Computer Science), 6(01), 47-54. https://doi.org/https://doi.org/10.52166/ujmc.v6i01.2387
Issue
Vol 6 No 01 (2020): Unisda Journal of Mathematics and Computer science
Section
Articles
Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Authors who publish in UJMC (Unisda Journal of Mathematics and Computer Science) agree to the following terms:

1.Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal. 

2.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.

3.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.