Determination of Optimal Cylinder Gas Packaging Distribution Routes Through the Solution of the Capacitated Vehicle Routing Problem at PT Samator Gas Industri Balikpapan

Vincent Surianto; Wahyuda Wahyuda; Farida Djumiati Sitania

doi:10.22441/ijiem.v7i1.31786

Determination of Optimal Cylinder Gas Packaging Distribution Routes Through the Solution of the Capacitated Vehicle Routing Problem at PT Samator Gas Industri Balikpapan

Penulis

Vincent Surianto Faculty of Engineering, Mulawarman University, Jl. Sambaliung No. 9 Kampus Gn. Kelua Samarinda, Kalimantan Timur 75119 http://orcid.org/0009-0009-7408-5127
Wahyuda Wahyuda Faculty of Engineering, Mulawarman University, Jl. Sambaliung No. 9 Kampus Gn. Kelua Samarinda, Kalimantan Timur 75119 http://orcid.org/0000-0001-7652-006X
Farida Djumiati Sitania Faculty of Engineering, Mulawarman University, Jl. Sambaliung No. 9 Kampus Gn. Kelua Samarinda, Kalimantan Timur 75119 http://orcid.org/0000-0001-8196-0780

DOI:

https://doi.org/10.22441/ijiem.v7i1.31786

Kata Kunci:

Route, Capacitated vehicle routing problem, Clarke-wright saving heuristic, Sweep, Nearest neighbor

Abstrak

The distribution of industrial and medical gases in Indonesia faces significant supply chain challenges. In general, the distribution is not yet fully adequate to meet the continuously growing demand. Based on this industrial issues, the researcher conducted an observation of PT Samator Gas Industri Balikpapan distribution activities. The company has not maximized the truck load by only loading 60 to 80 cylinders per truck. The issue has resulted in fuel costs not being optimal. Another issue arises because the distribution routes is done subjectively without considering the best route to deliver products. In this research, the issue was addressed by solving the Capacitated Vehicle Routing Problem (CVRP) using the Clarke-Wright Saving Heuristic Algorithm and the Sweep Algoritm (cluster first, route second), combined with the Nearest Neighbor route sorting method. Based on the research results, the Clarke-Wright Saving Heuristic Algorithm successfully reduced the travel distance to 167.1 km and resulted in fuel cost savings of IDR402,051.67 (49.21%). Meanwhile, the route generated by the Sweep Algorithm also showed better results compared to the initial route. The Sweep Algorithm produced savings of IDR340,465.00 (41.67%). Although the results obtained were not better than those of the Clarke-Wright Saving Heuristic Algorithm, the Sweep Algorithm has the advantage of simplifying the grouping process of delivery points based on their geographical proximity, making the route more efficient even without complex calculation steps.

Unduhan

Data unduhan belum tersedia.

Referensi

Arifian, R, & Pulansari, F. (2023). Determination of the Shortest Distribution Routes to Minimize Fuel Consumption and CO2 Emission Using Sweep and Clarke & Wright Saving Algorithms. IJIEM: Indonesian Journal of Industrial Engineering and Management. 4(2): 146-156 https://doi.org/10.22441/ijiem.v4i2.20493

Azhar, FJ, Astari, AN, Rizky, CA, & Fauzi, M. (2023). Penentuan Rute Terbaik pada Distribusi Produk X di PT BCD Menggunakan Metode Saving Matrix dan Nearest Neighbors. Jurnal Taguchi: Jurnal Ilmiah Teknik dan Manajemen Industri. 3(1): 702-711. https://doi.org/10.46306/tgc.v3i1

Bastuti, S, Alfatiyah, R, Shobur, M, & Candra, A. (2019). Manajemen Logistik. Pamulang: Unpam Press.

Bastuti, S, & Teddy. (2017). Analisis Persediaan Barang dengan Metode Time Series dan Sistem Distribution Requirement Planning untuk Mengoptimalkan Permintaan Barang di PT. Asri Mandiri Gemilang. Prosiding Seminar Ilmiah Nasional: Membangun paradigma Kehidupan Melalui Multidisiplin Ilmu 2. 2(1): 116-126.

Chopra, S, & Meindl, P. (2016). Supply Chain Management: Strategy, Planning, and Operation, edk 6. Pearson Education Inc.

Duque, PAM, Dolinskaya, IS, & Sörensen, K. (2016). Network Repair Crew Scheduling and Routing for Emergency Relief Distribution Problem. European Journal of Operational Research. 248(1): 272–285. https://doi.org/10.1016/j.ejor.2015.06.026

Fitriani, NA, Pratama, RA, Zahro, S, Utomo, PH, & Martini, TS. (2021). Solving Capacitated Vehicle Routing Problem Using Saving Matrix, Sequential Insertion, and Nearest Neighbor of Product ‘X’ in Grobogan District, AIP Conference Proceedings 2326-020007: 1-9. https://doi.org/10.1063/5.0039295

Ibrahim, AA, Lo, N, Abdulaziz, RO, & Ishaya, JA. (2019). Capacitated Vehicle Routing Problem. International Journal of Research Granthaalayah. 7(1): 310-327. https://doi.org/10.29121/granthaalayah.v7.i3.2019.976.

Kusuma, AS, & Sumiati. (2020). Penerapan Metode Clarke and Wright Saving Heuristic dalam Menentukan Rute Pendistribusian Produk di Bagian Distributor Koperasi ABC Bojonegoro. Juminten: Jurnal Manajemen Industri dan Teknologi. 1(4): 1-11. https://doi.org/10.33005/juminten.v1i4.116

Lestari, P, Hasibuan, A, & Harahap, B. (2022). Analisis Penentuan Rute Distribusi Menggunakan Metode Nearest Neighbor di PT Medan Juta Rasa Tanjung Morawa. Factory Jurnal Industri Manajemen dan Rekayasa Sistem Industri. 1(1): 26-32. https://doi.org/10.56211/factory.v1i1.110

Margie, LA, Yulianto, Triputra, DR, & Darmansyah, M. (2020). Pengantar Bisnis. Pamulang: Unpam Press.

Nezarulloh, MY, & Sumiati. (2024). Paper Distribution Route Optimization Using Ant Colony Method at PT. XY. IJIEM: Indonesian Journal of Industrial Engineering and Management. 5(2): 545-553. https://doi.org/ 10.22441/ijiem.v5i2.22356.

Purnomo, A, Syafrianita, Ismail, H, & Dinata, RS. (2023). Minimasi Biaya Distribusi Es Balok dan Es Kristal Menggunakan Metode Capacitated Vehicle Routing Problem di PT Agronesia Es Saripetojo Bandung. Logistics and Accounting Development Journal. 4(2): 10-25. https://doi.org/10.47491/landjournal.v4i1.2924

Rahmadini, W, Satya, RRD, & Nugeroho, AAU. (2023). Penentuan Rute Pengiriman Produk Skincare di CV Vavl Beaute Store dengan Metode Algoritma Sweep dan K-Nearest Neighbor. Jurnal Logistica. 2(1): 30-37. https://doi.org/10.62375/logistics.v2i1

Sarjono, H. (2014). Determination of Best Route to Minimize Transportation Costs Using Nearest Neighbor Procedure. Applied Mathematical Sciences. 8(62):, 3063-3074. https://doi.org/10.12988/ams.2014.43225

Simanungkalit, I, Sawaluddin, Gultom, P, & Nasution, PK. (2022). Analysis of The Use of Sweep Algorithms to Solve Capacitated Vehicle Routing Problems. FARABI: Jurnal Matematika dan Pendidikan Matematika. 5(2): 161-166. https://doi.org/10.47662/farabi.v5i2.416

Solihin, Muhendra, R, Widyantoro, M, & Munawir, A. (2023). Optimasi Rute Kendaraan pada Pendistribusian Produk Agroindustri Menggunakan Metode Sweep dan Nearest-Neighbor. Jurnal Mekanova: Mekanikal, Inovasi dan Teknologi. 9(2): 1-10. https://doi.org/10.35308/jmkn.v9i2.

Sukendar, I, Sugiyono, A, Hanifati, PR. (2020). Penentuan Ulang Rute Distribusi Menggunakan Metode Clarke and Wright Saving Heuristic. Applied Industrial Engineering Journal. 4(1): 1-8. https://doi.org/10.33633/aiej.v4i1.4609

Tamin, OZ. (2002). Perencanaan dan Pemodelan Transportasi. Bandung: Penerbit ITB.

Toth, P, & Vigo, D. (2002). The Vehicle Routing Problem. Philadelphia: Society for Industrial and Applied Mathematics.

Wibisono, E. (2018). Logika Logistik: Teknik dan Metode Pemrograman dalam Problem-problem Pengaturan Rute. Yogyakarta: Graha Ilmu.

Unduhan

PDF (English)

Diterbitkan

2026-03-26

Cara Mengutip

Surianto V, Wahyuda W, Sitania FD. Determination of Optimal Cylinder Gas Packaging Distribution Routes Through the Solution of the Capacitated Vehicle Routing Problem at PT Samator Gas Industri Balikpapan. IJIEM [Internet]. 26 Maret 2026 [dikutip 28 Mei 2026];7(1):159-68. Tersedia pada: https://training-ojs3-publikasi.mercubuana.ac.id/index.php/ijiem/article/view/31786

Unduh Sitasi

Terbitan

Vol 7 No 1: February 2026

Bagian

Articles

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.