Aplikasi Penentuan Rute Distribusi LPG 3 Kg
Main Article Content
Keywords
LPG 3 Kg, rute pengiriman, algoritma Clarke and Wright Savings Matrix, metode Branch and Bound
Abstract
PT IB. Sumberdaya Development is one of LPG agent partners of PT Pertamina. This company is assigned to distribute 3 kg LPG. The LPG shipment is carried out from Monday to Saturday. The shipment goes to 66 depots using agent vehicle which are registered in PT Pertamina. From the preliminary study, there were problems which related to the long-distance shipment, and the limitation of transportation and capacity. In this research, the shipment routes of 3 kg LPG in PT IB is determined. Sumberdaya Development problems consist of the distance of the travel, the time of travel, and optimal transportation cost. Based on Clarke and Wright Savings Matrix algorithm, by considering the vehicle capacity, the distance can be minimized. The point of this algorithm is calculating the saving by measuring the available reduction of distance and time. It is done by linking the existing depots and making a route which is based on the largest saving value of the distance from the agent to the destination depot. Each route is optimized by WIN QSB software by using Branch and Bound method. A program to facilitate the determination of shipment routes by using PHP programming language is designed. The proposed route for the 3kg LPG shipment is 762.35km with 33.58% saving, and the proposed time is 2929 minutes with 15.27% saving. The shipment schedule is designed from Monday to Saturday day to Saturday with each of 7 routes. This is better than the actual route used by the company.
References
[2] W. A. Subakdo and Y. A. Nugroho, “In-Bound dan Out-Bound Logistic pada Distribusi LPG 3KG di Indonesia,” J. Univ. Muhammadiyah Jakarta, no. November, pp. 1–10, 2016.
[3] R. K. Andadari, P. Mulder, and P. Rietveld, “Energy poverty reduction by fuel switching. Impact evaluation of the LPG conversion program in Indonesia,” Energy Policy, vol. 66, pp. 436–449, 2014.
[4] M. Sianipar, D. Fu, W. Sutopo, and M. Hisjam, “Penentuan Rute Kendaraan Menggunakan Metode Clark and Wright (Studi Kasus: PT . Sinar Sosro),” Performa, vol. 16, no. 2, pp. 143–151, 2017, https://doi.org/10.20961/performa.16.2.16990.
[5] K. Braekers, K. Ramaekers, and I. Van Nieuwenhuyse, “The Vehicle Routing Problem: State of the Art Classification and review,” Comput. Ind. Eng., vol. 99, pp. 300–313, 2016, https://doi.org/10.1016/j.cie.2015.12.007.
[6] A. Ikhsan, “Optimalisasi Distribusi Produk Menggunakan Daerak Penghubung dan Metode Saving Matrix,” J. REKAVASI, vol. 1, pp. 1–10, 2013.
[7] I. S. Kurniawan, S. Susanty, and H. Adianto, “Usulan Rute Pendistribusian Air Mineral Dalam Kemasan Menggunakan Metode Nearest Neighbour dan Clarke & Wright Savings,” J. Online Inst. Teknol. Nas., vol. 1, no. 4, pp. 125–136, 2014.
[8] R. Ekawati and N. Febriana, “Optimalisasi Rute Distribusi Air Minum Quelle dengan Algoritma Clarke & Wright Saving dan Model,” in Seminar Nasional Inovasi Dan Aplikasi Teknologi Di Industri, 2017, pp. 1–7.
[9] A. W. Saputra et al., “Optimalisasi Vehicle Routing Problem Dengan Pendekatan Metode Saving Matrix dan Clarke & Wright Saving Heuristic,” J. Rekavasi, vol. 5, no. 1, pp. 1–9, 2017.
[10] S. Kasus, P. T. Paris, J. Mandiri, D. B. Paillin, and J. M. Tupan, “Pemecahan Traveling Salesman Problem Menggunakan Teknik Branch and Bound dan Cheapest Insertion Heuristic,” in Seminar dan Konferensi Nasional IDEC, 2018, no. 2014, pp. 7–8.
[11] Kementrian Perhubungan RI, “Peraturan Menteri Perhubungan Republik Indonesia Nomor PM 111 Tahun 2015 tentang Tata Cara Penetapan Batas Kecepatan.” pp. 1–27, 2015.
[12] L. Octora, A. Imran, and S. Susanty, “Pembentukan Rute Distribusi Menggunakan Algoritma Clarke & Wright Savings dan Algoritma Sequential Insertion,” Reka Integr., vol. 2, no. 2, pp. 1–11, 2014.
[13] W. K. Cahyaningsih, “Penyelesaian Capacitatedvehicle Routing Problem (Cvrp) Menggunakan Algoritma Sweep Untuk Optimasi Rute Distribusi Surat Kabar Kedaulatan Rakyat,” in Seminar Nasional Matematika dan Pendidikan Matematika UNY, 2015, pp. 1–8.
[14] A. Rini, S. Susanty, and Y. Nurdiansyah, “Usulan Perbaikan Rute Pendistribusian Ice Tube Menggunakan Metode Nearest Neighbour Dan Genetic Algorithm *,” J. Online Inst. Teknol. Nas., vol. 3, no. 4, pp. 401–410, 2015.
[15] P. Amriyati, D. Chaerani, and E. Lesmana, “Solusi Optimal Model Optimisasi Robust Untuk Masalah Traveling Salesman Dengan Ketidaktentuan Kotak Dan Pendekatan Metode Branch And Bound,” J. Tek. Ind., vol. 17, no. 2, pp. 81–88, 2016, https://doi.org/10.9744/jti.17.2.81-88.
[16] A. Suhadya, “Perancangan Website Sebagai Media Promosi dan Informasi,” J. Inform. Pelita Nusant., vol. 3, no. 1, pp. 82–86, 2018.
[17] D. Meilani, Y. Meuthia, and F. Andika, “Perancangan Sistem Informasi Administrasi Penduduk (Studi Kasus: Nagari Panyubarangan Kabupaten Dharmasraya),” in Seminar Nasional Sistem Komputer dan Informatika (SNSKI) 2014, Perkembangan Teknologi Mobile: Hardware, Software dan Aplikasi, 2014, pp. 204–216.
Article Sidebar
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Authors' Retention of Copyright
Authors retain the copyright of their original work published in Jurnal Optimasi Sistem Industri (JOSI). By submitting their manuscript to the journal, authors grant Jurnal Optimasi Sistem Industri (JOSI) a non-exclusive license to publish the work under the CC BY-NC-SA 4.0 International License. This means that others are permitted to:
- Share and adapt the work for non-commercial purposes, provided proper attribution is given to the original authors and source.
- Create derivative works based on the original article, as long as the new work is non-commercial and under the same CC BY-NC-SA 4.0 International License.
Non-Commercial Usage
The CC BY-NC-SA 4.0 International License restricts commercial use of the published work and its derivatives. Commercial use includes generating revenue, financial gain, or any form of commercial exploitation. This limitation aims to preserve the scholarly and educational nature of the content.
ShareAlike Requirement
If you remix, adapt, or build upon the work, you must distribute your contributions under the same CC BY-NC-SA 4.0 International License as the original work. This "ShareAlike" requirement ensures that any new works based on the original content adhere to the same non-commercial, share-alike principles.
Usage, Attribution, and Citations
Authors and readers are allowed to:
- Share and distribute the published article in any medium or format.
- Adapt, remix, transform, and build upon the article for non-commercial purposes.
- Provide appropriate attribution to the original authors and the journal.
When using content from Jurnal Optimasi Sistem Industri (JOSI), proper attribution must be provided through citation of the original source and authors.
Copyright Infringement and Ethical Considerations
If you believe that any material published in Jurnal Optimasi Sistem Industri (JOSI) infringes upon your copyright or the copyright of someone you represent, please contact the editorial team promptly. The journal is committed to addressing copyright concerns in accordance with established ethical guidelines set forth by the Committee on Publication Ethics (COPE).
For any questions or inquiries related to copyright and licensing, please contact the editorial team at editor_josi[at]eng.unand.ac.id.