Penentuan Rute Distribusi Feasible untuk Vehicle Routing Problem with Time Windows dengan Metode Sequential Insertion Pada CV. Hagia Mitra Mandiri

Main Article Content

Prayoga Hidayat
Winarno
Wahyudin

Abstract

CV. Hagia Mitra Mandiri is a company that distributes black queen bee honey products. Problems faced by CV. Hagia Mitra Mandiri in the distribution of its products, namely that the company has not yet planned product delivery routes to various customers of bitter black queen bee honey in the Jakarta, Bogor, Depok, Bekasi and Karawang areas. As a result, product delivery routes often exceed customer working hours, which can make delivery schedules less than optimal in terms of distance, travel time and delivery costs. This research aims to design the route that each vehicle must take according to the user's working hours, with the aim of optimizing the total travel distance. The method used is the sequential insertion algorithm method to solve the Vehicle Routing Problem with Time Windows problem model. The sequential insertion method is used to plan proposed distribution routes by considering travel distance, travel time and transportation costs. The research results show that there are differences in the proposed route from the initial route. The proposed route resulting from the calculation of the sequential insertion algorithm method produces the best distance, namely 307 km with a savings ratio of 18.13%, a comparison of total transportation cost savings of Rp. 58,758 and the difference in fuel usage is 7.55 liters. The total travel time is 667 minutes and the total travel time ratio is 9.01%.

Article Details

How to Cite
[1]
P. Hidayat, Winarno, and Wahyudin, “Penentuan Rute Distribusi Feasible untuk Vehicle Routing Problem with Time Windows dengan Metode Sequential Insertion Pada CV. Hagia Mitra Mandiri”, JSE, vol. 9, no. 1, pp. 7853 –, Dec. 2023.
Section
Articles

References

N. P. D. Arwini and I. M. Juniastra, “Peran Transportasi Dalam Dunia Industri,” J. Ilm. Vastuwidya, vol. 6, no. 1, pp. 70–77, 2023, [Online]. Available: https://ejournal.universitasmahendradatta.ac.id/index.php/vastuwidya/article/view/794

Y. Dinata and S. Kempa, “Supply Chain Drivers Pada Pt Magna Djatim Mandiri,” Agora, vol. 5, no. 1, 2017.

H. Maulity, “Perencanaan Jumlah Pengalokasian Produk dan Rute Pengiriman untuk Meminimalkan Biaya Distribusi,” J. Tek. Ind., vol. 9, no. 2, pp. 164–168, 2009, doi: 10.22219/jtiumm.vol9.no2.164-168.

S. L. Karundeng, Thessa Natasya Mandey and J. S. B. Sumarauw, “Analisis Saluran Distribusi Kayu (Studi Kasus Di Cv. Karya Abadi, Manado),” J. EMBA J. Ris. Ekon. Manajemen, Bisnis dan Akunt., vol. 6, no. 3, pp. 1748–1757, 2018.

A. Noor Rahmah and N. Kusuma Ningrat, “Penentuan Moda Transportasi Untuk Efisiensi Biaya Kirim Dengan Metode Ahp Pada Ikm Kerupuk Idaman Ciamis,” J. Ind. Galuh, vol. 2, no. 2, pp. 71–79, 2023, doi: 10.25157/jig.v2i2.2969.

N. K. Kertiasih, “Penggunaan Metode Transportasi Dalam Program Linier Untuk Pendistribusian Barang,” J. Pendidik. Teknol. dan Kejuru., vol. 6, no. 2, pp. 27–35, 2012, doi: 10.23887/jptk.v6i2.24.

D. Dermawan, “Menentukan Rute Pengiriman Produk PT. Unicharm Indonesia Dengan Meminimalkan Biaya Transportasi Menggunakan Metode Saving Matrix di ‘CV. Jaya Abadi,’” J. Ilm. Wahana Pendidik., vol. 8, no. 12, pp. 63–72, 2022, [Online]. Available: https://doi.org/10.5281/zenodo.6943407

Z. Ulhaq Farid and E. Aristriyana, “Penjadwalan Distribusi Produk Dengan Metode Distribution Requirement Planing (Drp) Pada Cv. Kijang Mas 69 Di Ciamis,” J. Ind. Galuh, vol. 3, no. 02, pp. 93–98, 2023, doi: 10.25157/jig.v3i02.2976.

N. Ikfan and Masudin, “Saving matrix untuk menentukan rute distribusi,” J. Ilm. Tek. Ind., vol. 2, no. 1, pp. 14–17, 2014.

D. A. P. Putri, “Vehicle Routing Problem Dengan Time Window Untuk Multiple Product Dan Multiple Route Menggunakan Algoritma Sequential Insertion,” J. Tek. Ind., vol. 17, no. 1, p. 22, 2017, doi: 10.22219/jtiumm.vol17.no1.22-30.

S. Abadi, C., Susanty and H. Adianto, “Penentuan rute kendaraan distribusi produk roti menggunakan metode Nearest Neighbor dan metode Sequential insertion,” Reka Integr., vol. 1, no. 3, 2013.

M. Sari, A. Dhoruri, and R. S. Eminugroho, “Penyelesaian Capacitated Vehicle Routing Problem Menggunakan Saving Matriks, Sequential Insertion dan Nearest Neighbour di Victoria RO,” J. Mat., vol. 5, no. 3, pp. 1–11, 2016.

L. A. Valentina, “Penentuan Muatan Dan Usulan Rute Distribusi Pengiriman Buku Di Cv Y Untuk Meminimasi Keterlambatan Pengiriman,” Progr. Stud. Tek. Ind. Fak. Teknol. Ind. Univ. Atma Jaya Yogyakarta, 2021, [Online]. Available: http://e-journal.uajy.ac.id/23423/%0Ahttp://e-journal.uajy.ac.id/23423/1/1606090591.pdf

B. Triputranto, “Pengaruh Segementasi Pasar Terhadap Optimasi Distribusi Produk (Studi kasus pada pengrajin sepatu Cibaduyut Bandung),” Ind. Eng. J., vol. 12, no. 2, pp. 68–80, 2017.

P. Dewi et al., “Analisis Pengendalian Persediaan dengan Metode (EOQ) Economic Order Quantity guna Optimalisasi Persediaan Bahan Baku Pengemas Air Mineral,” J. Akunt. Profesi, vol. 10, no. 2, pp. 1–12, 2019, [Online]. Available: https://ejournal/undiksha.ac.id