Penentuan Rute Pendistribusian Gas LPG Menggunakan Algoritma Prim dengan Optimalisasi melalui Pergantian Sisi
DOI:
https://doi.org/10.30605/proximal.v7i1.3063Keywords:
Route, Prim Algorithm, Edge ExchangeAbstract
This research examines the determination of LPG gas distribution routes. The study is conducted on data collected by Elia Resita Ningrum in her research titled "Optimizing LPG Gas Distribution Routes Using the Floyd Warshall Algorithm and the Greedy Algorithm." This data is processed using different methods with the aim of obtaining better LPG gas distribution routes. The method to be used is the Prim algorithm, followed by route improvement through edge exchange in the graph. The Prim algorithm is used to obtain a minimum spanning tree. From this minimum spanning tree, one of the distribution routes is selected, namely v_1-v_2-v_3-v_4-v_8-v_4-v_10-v_11-v_10-v_4-v_5-v_6-v_7-v_9-v_12-v_13-v_14 with a total weight of 11.26. Route improvement is then carried out by exchanging edges in the graph, resulting in a new route, namely v_1-v_2-v_8-v_4-v_10-v_11-v_10-v_4-v_5-v_6-v_7-v_9-v_12-v_13-v_14 with a total weight of 10.91. This result is better than the result obtained by Elia Resita Ningrum with a total weight of 11.13. Based on the results obtained, for the case of LPG gas distribution by PT Petro Jaya Gas, the use of the Prim algorithm with route improvement through edge exchange produces better routes compared to the use of the Floyd Warshall Algorithm and the Greedy Algorithm conducted by Elia Resita Ningrum.Keywords: Route, Prim Algorithm, Edge Exchange.
Downloads
References
Alifiani, I., dkk. (2021). Solusi Optimal Pencarian Jalur Tercepat Menggunakan Algoritma Dijkstra untuk Mencari Lokasi Cafe di Bumiayu. Jurnal Derivat, v.8, n.2, p.140-148.
Applegate, D. L., dkk. (2006). The Traveling Salesman Problem, United Kingdom, Princeton University Press.
Arif, M. & Marbun, J. P. (2023). Pencarian Rute Terbaik Pendistribusian BBM dari Terminal BBM ke SPBU Wilayah Kota Medan Menggunakan Algoritma Dijkstra dengan Logika Fuzzy sebagai Penentu Bobot pada Graf. FARABI: Jurnal Matematika dan Pendidikan Matematika, v.6, n.1, p.10-19.
Balakrishnan, R. & Ranganathan, K. (2012). A Textbook of Graph Theory Second Edition, New York, Springer.
Bunaen, M. C., dkk. (2022). Penerapan Algoritma Dijkstra untuk Menentukan Rute Terpendek dari Pusat Kota Surabaya ke Tempat Bersejarah. Jurnal Teknologi Dan Sistem Informasi Bisnis, v.4, n.1, p.213-223.
Clark, J. & Holton, D. A. (1995). A First Look at Graph Theory. Singapur, World Scientific PubUshing Co. Pte. Ltd.
Fitriani, S., dkk. (2022). Penerapan Algoritma Bellman-Ford dalam Menentukan Rute Terpendek Objek Wisata Kabupaten Lampung Timur. Jurnal Siger Matematika, v.3, n.2, p.53-60.
Greco, F. (2008). Travelling Salesman Problem, Croatia, in-teh.
Lusiani, A., dkk. (2021). Algoritma Prim dalam Penentuan Lintasan Terpendek dan Lintasan Tercepat pada Pendistribusian Logistik Bulog Jawa Barat. The 12th Industrial Research Workshop and National Seminar Bandung-IRWNS 2021. Prosiding 673-677.
Nggufron, N., dkk. (2019). Pencarian Rute Terbaik Pemadam Kebakaran Kota Semarang Menggunakan Algoritma Dijkstra dengan Logika Fuzzy sebagai Penentu Bobot pada Graf. UNNES Journal of Mathematics, v.8, n.1, p.40-49.
Ningrum, E. R., dkk. (2023). Optimasi Rute Pendistribusian Gas Elpiji Menggunakan Algoritma Floyd Warshall dan Algoritma Greedy. Jurnal Ilmiah Matematika dan Terapan, v.20, n.1, p.1-14.
Rahmadi, D. & Sandariria, H. (2023). Penerapan Minimum Spanning Tree dalam Menentukan Rute Terpendek Distribusi Naskah Soal USBN di SMA Negeri se-Sleman. Basis : Jurnal Ilmiah Matematika, v.2, n.1, p.66-71.
Widianto, T., dkk. (2021). Optimalisasi Metode Weighted-Sum Dijkstra Algorithm untuk Menentukan Rute Terbaik yang Sesuai dengan Kebutuhan. Jurnal CoreIT, v.7, n.1, p.13-19.
Downloads
Published
How to Cite
Issue
Section
License
In submitting the manuscript to the journal, the authors certify that:
- They are authorized by their co-authors to enter into these arrangements.
- The work described has not been formally published before, except in the form of an abstract or as part of a published lecture, review, thesis, or overlay journal.
- That it is not under consideration for publication elsewhere,
- That its publication has been approved by all the author(s) and by the responsible authorities – tacitly or explicitly – of the institutes where the work has been carried out.
- They secure the right to reproduce any material that has already been published or copyrighted elsewhere.
- They agree to the following license and copyright agreement.
License and Copyright Agreement
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution License (CC BY 4.0) 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.