Desain Rute dan Optimasi Biaya Transportasi Pengisian Tabung Oksigen menggunakan Metode Complete Enumeration pada CV. Tasman Gases
DOI:
https://doi.org/10.30737/jurmatis.v5i1.2207Abstract
The increasing demand for filling oxygen cylinders makes CV. Tasman Gases has always been consistent in planning transportation cost optimization strategies. The filling of oxygen cylinders in one distribution can transport up to 45 tubes sent to the concerned partner. The purpose of this study is to determine the shortest route and optimal cost in distributing. The method used is Complete Enumeration. The samples used include distribution locations and mileage. The procedure used begins with determining the number of routes, estimated mileage and fuel costs. There is the most optimal route selected from the 12 modeled routes. The selected route has the least transportation costs. This research makes CV. Tasman Gases has the best route, A-D-C-E-F with a distance of 10.9 km worth Rp. 10,423.13. This value is more effective than the existing A-E-C-D-F condition with a distance of 12.8 km obtaining fuel costs of Rp. 12,240.00. Thus, the distribution route and costs that have been optimal make CV. Tasman Gases can implement and identify future transportation constraints.References
N. Bešinović, “Resilience in railway transport systems: a literature review and research agenda,†Transp. Rev., vol. 40, no. 4, pp. 457–478, 2020, doi: 10.1080/01441647.2020.1728419.
J. Maheut and J. P. Garcia-Sabater, “Algorithm for Complete Enumeration based on a stroke graph to solve the supply network configuration and operations scheduling problem,†J. Ind. Eng. Manag., vol. 6, no. 3 SPL.ISS, pp. 779–795, 2013, doi: 10.3926/jiem.550.
S. Zhang, Q. Hui, X. Bai, and R. Sun, “Bilevel Optimization for the Hazmat Transportation Problem with Lane Reservation,†J. Adv. Transp., vol. 2020, 2020, doi: 10.1155/2020/2530154.
D. E. William Tanujaya, Dian Retno Sari Dewi, “Penerapan Algoritma Genetik Untuk Penyelesaian Masalah Vehicle Routing Di PT.MIF,†Widya Tek., vol. 10, no. 1, pp. 92–102, 2013, [Online]. Available: http://journal.wima.ac.id/index.php/teknik/article/view/163.
C. Iliopoulou and K. Kepaptsoglou, “Combining ITS and optimization in public transportation planning: state of the art and future research paths,†Eur. Transp. Res. Rev., vol. 11, no. 1, 2019, doi: 10.1186/s12544-019-0365-5.
Lukmandono, M. Basuki, M. J. Hidayat, and F. B. Aji, “Application of Saving matrix Methods and Cross Entropy for Capacitated Vehicle Routing Problem (CVRP) Resolving,†IOP Conf. Ser. Mater. Sci. Eng., vol. 462, no. 1, 2019, doi: 10.1088/1757-899X/462/1/012025.
N. S. Kurnia, S. Salsabila, S. D. H. Sihombing, and I. B. Kharisma, “Perbandingan Jalur Distribusi Optimal Alat Pelindung Diri dengan Metode Saving matrix dan Pendekatan Nearest Neigbour Di Rumah Sakit Rujukan Covid-19 di Jawa Barat,†vol. 12, no. 7, pp. 2788–2797, 2021.
T. R. Damayanti, A. L. Kusumaningrum, Y. D. Susanty, and S. S. Islam, “Route optimization using saving matrix method – a case study at public logistics company in indonesia,†Proc. Int. Conf. Ind. Eng. Oper. Manag., no. August, 2020.
E. Safitri, S. Basriati, and H. Najmi, “Penerapan Metode North west corner dalam Optimalisasi Produk Mebel (Studi kasus: Toko Mebel di Jalan Marsan, Panam),†Kubik J. Publ. Ilm. Mat., vol. 5, no. 1, pp. 43–53, 2020, doi: 10.15575/kubik.v5i1.8611.
Y. N. Firdaus, N. L. Buyung, A. Hermansyah, R. Nurhadiyati, I. Falani, and E. Wiratmani, “Implementasi Algoritma North west corner dalam Penentuan Jumlah Produksi untuk Memaksimalkan Keuntungan,†STRING (Satuan Tulisan Ris. dan Inov. Teknol., vol. 4, no. 1, p. 65, 2019, doi: 10.30998/string.v4i1.3717.
M. Rizki Ichwani and A. Suyitno, “Penggunaan Algoritma North west corner pada Optimasi Rute Pendistribusiian Air Minum dalam Kemasan,†Unnes J. Math., vol. 4, no. 1, 2015, [Online]. Available: http://journal.unnes.ac.id/sju/index.php/ujm.
V. Arfana Perdana, Z. Fatimah Hunusalela, and A. Teja Prasasty, “Penerapan Metode Saving matrix Dan Algoritma Nearest neighbor Dalam Menentukan Rute Distribusi Untuk Meminimalkan Biaya Transportasi Pada PT. XYZ,†JATI UNIK J. Ilm. Tek. dan Manaj. Ind., vol. 4, no. 2, p. 91, 2021, doi: 10.30737/jatiunik.v4i2.1000.
F. Adien Saputra, “Impelementasi Distribution Requrement Planning Dan Saving matrix Untuk Meminimalisasi Biaya Distribusi,†J. Ilm. Tek. dan Manaj. Ind. Univ. Kadiri, vol. 4, no. 2, pp. 119–131, 2021, [Online]. Available: http://ojs.unik-kediri.ac.id/index.php/jatiunik/index.
M. I. Amaluna, N. Alamsyah, R. Khofia, and M. Fauzi, “Mengoptimalkan Biaya Transportasi Menggunakan Metode North west corner,†J. Manaj. Teknol. dan Tek. Ind. Univ. Kediri, vol. 4, no. 1, pp. 26–36, 2022.
N. A. F. P. Adam, I. P. Sari, A. Tasya, W. Sutopo, and Yuniaristanto, “Determination of Routes for Daily Newspaper Product Distribution with Saving matrix Methods,†IOP Conf. Ser. Mater. Sci. Eng., vol. 943, no. 1, 2020, doi: 10.1088/1757-899X/943/1/012040.
M. Kholil, Hendri, R. David Mangaraja, and R. Bagus Yosan, “Improving the Efficiency of the Milkrun Truck Suppliers in Cikarang Area by Merging the Payload Cycles and Optimizing the Milkrun Route Using the Saving matrix Methods,†J. Phys. Conf. Ser., vol. 1175, no. 1, 2019, doi: 10.1088/1742-6596/1175/1/012201.
G. Kurnia, N. Putu, and D. Velicia, “Optimizing Warehouse Distribution Routes During Eid Season Using Saving matrix and Nearest Insert Method,†J. Logistik Indones., vol. 5, no. 2, pp. 111–119, 2021.
M. Amri, A. Rahman, and R. Yuniarti, “Penyelesaian Vehicle Routing Problem dengan Menggunakan Metode Nearest Neighbour,†J. Rekayasa dan Manaj. Sist. Ind., vol. 2, no. 1, pp. 36–45, 2014.
A. A. Hidayanti, F. H. Fauzan, M. F. A. Damanik, and M. Fauzi, “Penjadwalan Pengiriman Produk Minuman Kemasan Dengan Menggunakan Metode Shipping Operation Diagram Pada PT. XYZ,†J. Manaj. Teknol. dan Tek. Ind. Univ. Kadiri, vol. 4, no. 1, pp. 14–25, 2022, doi: 10.30871/ji.v11i2.1664.Perusahaan.
C. Zhu and Q. Liao, “Complete weight enumerators for several classes of two-weight and three-weight linear codes,†Finite Fields their Appl., vol. 75, no. 12071321, p. 101897, 2021, doi: 10.1016/j.ffa.2021.101897.
S. Lu, H. Song, and X. Xu, “An enumeration method applied in intelligent transportation system,†Int. J. Smart Home, vol. 9, no. 2, pp. 143–150, 2015, doi: 10.14257/ijsh.2015.9.2.13.
I. A. S. Syafiin, S. N. Fatimah, and M. Fauzi, “Travelling Salesman Problem Analysis with Complete Enumeration Method, Branch & Bound and Greedy Heuristic,†Eduvest - J. Univers. Stud., vol. 1, no. 8, pp. 752–756, 2021, doi: 10.36418/edv.v1i8.144.
C. B. K. Wulandari, “Penentuan Rute Distribusi Menggunakan Metode Nearest neighbors dan Metode North west corner Untuk Meminimumkan Biaya Distribusi di PT. X,†J. Optimasi Tek. Ind., vol. 2, no. 1, p. 7, 2020, doi: 10.30998/joti.v2i1.3848.
N. Ikfan and M. Ilyas, “Penentuan rute Transportasi Terpendek untuk Meminimalkan Biaya Menggunakan Metode Saving Matriks,†J. Ilm. Tek. Ind., vol. 12, no. 2, pp. 165–178, 2013.
P. Wahyuningsih and A. Rokhman, “Pengiriman Barang dengan Dijkstra Algorithm Berbasis Web Pada Pt . Agung Pancar Mulia,†vol. 12, no. 1, pp. 39–44, 2021.
J. Sharp, “Travel Survey Methods and Technologies Resource Paper,†Management, no. 2, pp. 1–22, 2015.
N. Huang, J. Li, W. Zhu, and H. Qin, “The multi-trip vehicle routing problem with time windows and unloading queue at depot,†Transp. Res. Part E Logist. Transp. Rev., vol. 152, no. April, p. 102370, 2021, doi: 10.1016/j.tre.2021.102370.
R. Braune and G. Zäpfel, “Shifting bottleneck scheduling for total weighted tardiness minimization - A computational evaluation of subproblem and re-optimization heuristics,†Comput. Oper. Res., vol. 66, pp. 130–140, 2016, doi: 10.1016/j.cor.2015.07.012.
F. N. Rivanda, M. As’Adi, and D. Montreano, “Analysis of resources allocation on passenger ship reparation project using work breakdown structure method in pt. xyz,†J. Phys. Conf. Ser., vol. 1899, no. 1, 2021, doi: 10.1088/1742-6596/1899/1/012086.
R. Wilfahrt and S. Kim, “Traveling Salesman Problem (TSP),†Encycl. GIS, pp. 1–4, 2016, doi: 10.1007/978-3-319-23519-6_1406-2.
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish with this journal agree to the following terms:
(1) The copyright of published articles will be transferred to the journal as the publisher of the manuscript. Therefore, the author needs to confirm that the copyright has been managed by the publisher with the Publication Right Form which must be attached when submitting the article.
(2) Publisher of JURMATIS is Kadiri University.
(3) The copyright follows Creative Commons Attribution“ShareAlike License (CC BY SA): This license allows to Share copy and redistribute the material in any medium or format, Adapt remix, transform, and build upon the material, for any purpose, even commercially.
