Optimization of Fast Moving Consumer Goods Distribution Routes Using Vehicle Routing Problem at PT Cahaya Mahakam Samarinda
DOI:
https://doi.org/10.22441/ijiem.v6i3.33473Kata Kunci:
Fast moving consumer goods, Vehicle routing problem, Sweep, Nearest neighbor, Branch and boundAbstrak
PT Cahaya Mahakam Samarinda, as one of the companies engaged in the distribution of fast-moving consumer goods, serves a variety of customers, including wholesalers, small shops, and food businesses. Based on the initial observations that have been made, the determination of distribution routes is carried out by the warehouse manager, who subjectively determines the route based on personal observations before the driver delivers consumer products because the company does not yet have the appropriate tools or methods to determine the route. This sometimes forces drivers to search for customer locations directly in the field if they have never delivered to that customer before, and sometimes there are inaccuracies in selecting the delivery route to the next customer. In this problem, it falls under the Vehicle Routing Problem, which is solved using the cluster first, route second approach with the Sweep method to create clusters and Nearest Neighbor with manual calculations, as well as Branch and Bound with calculations using the WinQSB software to determine the route for each created cluster. The results of both route creation methods were compared with the initial route. Based on the research results, the Sweep method produced 9 fewer clusters compared to the initial route of 11 clusters. In route determination, the Nearest Neighbor method resulted in a distance savings of 55.4 km (20.11%) and a cost savings of IDR 74,190.43. The Branch and Bound method resulted in savings of 64.6 km (23.47%) and cost savings of IDR 93,144.07.Unduhan
Referensi
Barata, D. D., Nainggolan, F., Prabowo, M. I., & Febiola, B. (2022). Analisis Kinerja Keuangan pada Perusahaan Manufaktur di Bidang Industri Barang Konsumsi. Journal of Global Business and Management Review, 4(2), 91–101. https://doi.org/10.37253/jgbmr.v4i2.7319
Evangelista, P., Kianto, A., Hussinki, H., Vanhala, M., & Nisula, A. M. (2023). Knowledge-Based Human Resource Management, Logistics Capability, and Organizational Performance in Small Finnish Logistics Service Providers. Logistics, MDPI, 7(1), 1–21. https://doi.org/10.3390/logistics7010012
Faturohman, M. I., Chaeron, M., & Putro, G. M. (2021). Penentuan Rute Distribusi Es Batu dengan Perubahan Permintaan untuk Meminimalkan Biaya Transportasi. Penentuan Rute Distribusi Es Batu Dengan Perubahan Permintaan Untuk Meminimalkan Biaya Transportasi, 40–45.
Jolfaei, A. A., Alinaghian, M., Bahrami, R., & Tirkolaee, E. B. (2023). Generalized Vehicle Routing Problem: Contemporary Trends and Research Directions. Heliyon, 9(12). https://doi.org/10.1016/j.heliyon.2023.e22733
Nurjanah, N., & Nabila. (2019). Pengoptimalan Rute dalam Pendistribusian Roti di PT. Daisei Log Indonesia Hub Cikarang Menggunakan MetodeTraveling Salesman Problem (TSP) Branch and Bound. Jurnal Logistik Bisnis, 9(2), 55. https://doi.org/10.46369/logistik.v9i02.585
Ramadhan, N. A., Ardiansyah, M. N., & Pambudi, H. K. (2023). Penentuan Rute Armada Pengiriman CV XYZ Menggunakan Pendekatan Vehicle Routing Problem with Time Window and Heterogeneous Fleet dengan Mixed Integer Linear Programming untuk Meminimasi Tingkat Keterlambatan. Journal of Production, Enterprise, and Industrial Applications, 1(1), 45–54. https://doi.org/10.25124/jpeia.v1i1.6753
Rizal, M. A., & Saidatuningtyas, I. (2024). Penentuan Rute Kendaraan Heterogen dengan Menggunakan Algoritma Sweep pada PT Sinar Mas Andhika. Ifa Saidatuningtyas INNOVATIVE: Journal Of Social Science Research, 4(5), 1150–1165. https://doi.org/10.31004/innovative.v4i5.14958
Siraj, M. A. (2024). Optimasi Jalur Distribusi pada UMKM Mitra Telur dengan Menggunakan Metode Saving Matrix Dan Nearest Neighbor. Jurnal Ilmiah Sains Teknologi Dan Informasi, 2(2), 29–38. https://doi.org/10.59024/jiti.v2i2.724
Sitompul, C., & Horas, O. M. (2021). A Vehicle Routing Problem with Time Windows Subject to the Constraint of Vehicles and Good’s Dimensions. International Journal of Technology, 12(4), 865–875. https://doi.org/10.14716/ijtech.v12i4.4294
Sugiono, M. C. (2022). Model Vehicle Routing Problem untuk Penentuan Rute Distribusi Unit Sepeda Motor dengan Metode Saving Matrix. Journal Industrial Servicess, 7(2), 230–233. https://doi.org/10.36055/jiss.v7i2.14018
Toth, P., & Vigo, D. (2002). The Vehicle Routing Problem. Society for Industrial and Applied Mathematics.
Waise, M. T. (2023). Impacts of the Distribution Process on Onion Supply Chain Management in Singida Urban District. European Journal of Logistics, Purchasing and Supply Chain Management, 11(3), 15–26. https://doi.org/10.37745/ejlpscm.2013/vol11n31526
Wang, L., Chen, X. Y., & Zhang, H. (2021). Joint Distribution Models in Fast-Moving Consumer Goods Wholesale Enterprise: Comparative Analysis and A Case Study. Advances in Production Engineering And Management, 16(2), 212–222. https://doi.org/10.14743/APEM2021.2.395
Wijaya, H. M., Deswantoro, G., & Hidayat, R. (2021). Analisis Perencanaan Supply Chain Management (SCM) pada PT. Kylo Kopi Indonesia. Jurnal Ekonomi Manajemen Sistem Informasi, 2(6), 795–806. https://doi.org/10.31933/jemsi.v2i6
Zupemungkas, H. O., & Handayani, W. (2021). Optimalisasi Rute Distribusi Menggunakan Metode Traveling Salesman Problem (TSP) untuk Meminimasi Biaya Distribusi. Jurnal Ekonomi Dan Bisnis, 8(2), 163–178. https://doi.org/10.34308/eqien.v8i2.246
Unduhan
Diterbitkan
Cara Mengutip
Terbitan
Bagian
Lisensi
The copyright to this article is transferred to Universitas Mercu Buana (UMB) if and when the article is accepted for publication. The undersigned hereby transfers any and all rights in and to the paper including without limitation all copyrights to UMB. The undersigned hereby represents and warrants that the paper is original and that he/she is the author of the paper, except for material that is clearly identified as to its original source, with permission notices from the copyright owners where required. The undersigned represents that he/she has the power and authority to make and execute this assignment.
We declare that:
1. This paper has not been published in the same form elsewhere.
2. It will not be submitted anywhere else for publication prior to acceptance/rejection by this Journal.
3. A copyright permission is obtained for materials published elsewhere and which require this permission for reproduction.
Furthermore, I/We hereby transfer the unlimited rights of publication of the above mentioned paper in whole to UMB. The copyright transfer covers the exclusive right to reproduce and distribute the article, including reprints, translations, photographic reproductions, microform, electronic form (offline, online) or any other reproductions of similar nature.
The corresponding author signs for and accepts responsibility for releasing this material on behalf of any and all co-authors. This agreement is to be signed by at least one of the authors who have obtained the assent of the co-author(s) where applicable. After submission of this agreement signed by the corresponding author, changes of authorship or in the order of the authors listed will not be accepted.
Retained Rights/Terms and Conditions
1. Authors retain all proprietary rights in any process, procedure, or article of manufacture described in the Work.
2. Authors may reproduce or authorize others to reproduce the Work or derivative works for the authors personal use or for company use, provided that the source and the UMB copyright notice are indicated, the copies are not used in any way that implies UMB endorsement of a product or service of any employer, and the copies themselves are not offered for sale.
3. Although authors are permitted to re-use all or portions of the Work in other works, this does not include granting third-party requests for reprinting, republishing, or other types of re-use.
