Penentuan rute terpendek dalam pengiriman pallet kayu menggunakan programa dinamis

Shania Viera Agnezia, Winarno Winarno

Abstract


Rute perjalanan adalah faktor utama yang dapat menentukan alur pendistribusian barang. Penelitian ini membahas penentuan rute terpendek pendistribusian pallet kayu dari CV. Bintang Jaya (Bogor) menuju ke PT. Yanmar Diesel Indonesia (Depok) untuk mendapatkan rute terpendek dan biaya ongkos yang murah. Tujuan penelitian ini membuat model perjalanan yang lebih pendek dengan membandingkan beberapa rute perjalanan yang ada, sehingga akan didapatkan rute perjalanan terpendek dari pilihan rute yang sering dilalui. Penyelesaian masalah pada penelitian ini menggunakan algoritma program dinamis dengan pendekatan forward recursive equation, dimana hanya menggunakan 1 kali perhitungan perjalanan tanpa arah sebaliknya dan perbandingan menggunakan software WinQSB. Hasil penelitian ini menghasilkan rute terpendek sebesar 33,4 Km dengan rute yaitu CV. Bintang Jaya–Sukamaju–Sukamanah–Cipeucang–Gandoang–Mekarsari–Cileungsi Kidul–Cileungsi–Nagrak–Cikeas Udik–Leuwinanggung–Jl. Raya Tapos 40-46–Sukatani–Sukamaju Baru–PT. Yanmar Diesel Indonesia. Dari jarak yang diperoleh terdapat pengurangan ongkos perjalanan menjadi Rp 40.000 – Rp 60.000 untuk sekali perjalanan. Model algoritma program dinamis dapat menyelesaikan permasalahan pemilihan rute dan penghematan ongkos pengiriman.

Keywords


Algoritma Program Dinamis; Penentuan Rute Terpendek; Vehicle routing problem

Full Text:

PDF

References


E. A. Syaputra and I. D. Djati, “Pengaruh jenis kayu dan sistem sambungan terhadap desain mebel kayu,” Jurnal Penelitian Hasil Hutan, vol. 39, no. 2, pp. 106–114, Jul. 2021, doi: 10.20886/jphh.2021.39.2.106-114.

R. D. Prasetya, “Potensi limbah kayu industri mebel untuk produk home accessories,” Productum: Jurnal Desain Produk (Pengetahuan dan Perancangan Produk), vol. 1, no. 1, pp. 39–51, 2015, doi: 10.24821/productum.v1i1.1652.

S. Herda and A. Setyawan, “Manajemen rantai pasok kayu gaharu di Kalimantan Barat,” Jurnal Manajemen Dayasaing, vol. 18, no. 2, pp. 92–101, Jul. 2017, doi: 10.23917/dayasaing.v18i2.4506.

N. Lahrichi, T. Gabriel Crainic, M. Gendreau, W. Rei, and L.-M. Rousseau, “Strategic analysis of the dairy transportation problem,” Journal of the Operational Research Society, vol. 66, no. 1, pp. 44–56, Jan. 2015, doi: 10.1057/jors.2013.147.

C. W. Oktavia, C. Natalia, I. Adigunawan, “Penentuan jalur rute distribusi produk fast moving consumer goods (FMCG) dengan menggunakan metode nearest neighbour (Studi kasus: PT.XYZ),” Jurnal Al-Azhar Indonesia Seri Sains Dan Teknologi, vol. 5, no. 2, pp. 101–110, 2019, doi: 10.36722/sst.v5i2.357.

F. Zhao, D. Wu, L. Liang, and A. Dolgui, “Lateral inventory transshipment problem in online-to-offline supply chain,” International Journal of Production Research, vol. 54, no. 7, pp. 1951–1963, 2016, doi: 10.1080/00207543.2015.1070971.

A. Khurana, “Variants of transshipment problem,” European Transport Research Review, vol. 7, no. 2, pp. 1–19, Jun. 2015, doi: 10.1007/s12544-015-0154-8.

T. G. Crainic, R. Giusti, D. Manerba, and R. Tadei, “The synchronized location-transshipment problem,” Transportation Research Procedia, vol. 52, pp. 43–50, Jan. 2021, doi: 10.1016/j.trpro.2021.01.007.

S. Naderi, K. Kilic, and A. Dasci, “A deterministic model for the transshipment problem of a fast fashion retailer under capacity constraints,” International Journal of Production Economics, vol. 227, p. 107687, Sep. 2020, doi: 10.1016/j.ijpe.2020.107687.

A. Kumar, R. Chopra, and R. R. Saxena, “An efficient algorithm to solve transshipment problem in uncertain environment,” International Journal of Fuzzy Systems, vol. 22, no. 8, pp. 2613–2624, Nov. 2020, doi: 10.1007/s40815-020-00923-9.

K. Aragane, T. Fukuba, and T. Shiina, “Multi-period stochastic lateral transshipment problem for rental products,” Asian Journal of Management Science and Applications, vol. 6, no. 1, pp. 32–48, Jan. 2021, doi: 10.1504/AJMSA.2021.118393.

S. Martono and H. L. H. S. Warnars, “Penentuan rute pengiriman barang dengan metode nearest neighbor,” PETIR, vol. 13, no. 1, pp. 44–57, Mar. 2020, doi: 10.33322/petir.v13i1.869.

M. Sianipar, D. Fu’ani, W. Sutopo, and M. Hisjam, “Penentuan rute kendaraan menggunakan metode clark and wright saving heuristic (Studi kasus : PT. Sinar Sosro),” Performa: Media Ilmiah Teknik Industri, vol. 16, no. 2, Dec. 2017, doi: 10.20961/performa.16.2.16990.

D. Meilani and A. Iswara, “Aplikasi penentuan rute distribusi LPG 3 kg,” Jurnal Optimasi Sistem Industri, vol. 17, no. 2, pp. 208–219, Oct. 2018, doi: 10.25077/josi.v17.n2.p208-219.2018.

A. Momon and D. W. Ardiatma, “Penentuan rute distribusi suku cadang kendaraan bermotor dalam meminimalkan biaya transportasi (Studi kasus: PT. Inti Polymetal Karawang),” JIEMS (Journal of Industrial Engineering and Management Systems), vol. 11, no. 1, Aug. 2018, doi: 10.30813/jiems.v11i1.1012.

K. Braekers, K. Ramaekers, and I. Van Nieuwenhuyse, “The vehicle routing problem: State of the art classification and review,” Computers & Industrial Engineering, vol. 99, pp. 300–313, Sep. 2016, doi: 10.1016/j.cie.2015.12.007.

J. R. Montoya-Torres, J. López Franco, S. Nieto Isaza, H. Felizzola Jiménez, and N. Herazo-Padilla, “A literature review on the vehicle routing problem with multiple depots,” Computers & Industrial Engineering, vol. 79, pp. 115–129, Jan. 2015, doi: 10.1016/j.cie.2014.10.029.

G. Kim, Y.-S. Ong, C. K. Heng, P. S. Tan, and N. A. Zhang, “City vehicle routing problem (City VRP): A Review,” IEEE Transactions on Intelligent Transportation Systems, vol. 16, no. 4, pp. 1654–1666, Aug. 2015, doi: 10.1109/TITS.2015.2395536.

H. Koswara, H. Adianto, and A. Nugraha, “Penentuan rute distribusi produk kaos pada dobujack inv. menggunakan metode nearest neighbour dan (1-0) insertion intra route,” Jurnal Rekayasa Sistem & Industri (JRSI), vol. 4, no. 02, pp. 192–198, Dec. 2017, doi: 10.25124/jrsi.v4i02.286.

M. R. Borman and M. Oktavia, “One vehicle routing problem as the best solution for a hangout catering company expansion plan with Lingo software,” Faktor Exacta, vol. 13, no. 4, pp. 216–231, Feb. 2021, doi: 10.30998/faktorexacta.v13i4.7540.

W. Winarno and A. A. N. P. Redi, “Analisa perbandingan metode simulated annealing dan large neighborhood search untuk memecahkan masalah lokasi dan rute kendaraan dua eselon,” Jurnal Manajemen Industri dan Logistik, vol. 4, no. 1, pp. 35–46, 2020, doi: 10.30988/jmil.v4i1.311.

S. Hong and Y. Kim, “A route-selecting order batching model with the S-shape routes in a parallel-aisle order picking system,” European Journal of Operational Research, vol. 257, no. 1, pp. 185–196, Feb. 2017, doi: 10.1016/j.ejor.2016.07.017.

A. D. Nugraha, Winarno, and A. F. Hadining, “A Mathematical model for solving distribution system problem by considering odd-even vehicle license plate rule,” J. Tek. Ind., vol. 23, no. 1, pp. 55–64, 2021.

V. F. Yu, Winarno, A. Maulidin, A. A. N. Perwira Redi, S. W. Lin, and C. L. Yang, “Simulated annealing with restart strategy for the path cover problem with time windows,” Mathematics, vol. 9, no. 14, pp. 1–22, 2021, doi: 10.3390/math9141625.

B. Widyantoro, Arini, H. T. Sukmana, I. Muhamad Malik Matin, and D. Khairani, “The Effectiveness of forward-backward combination method in dynamic programming,” in 2021 Sixth International Conference on Informatics and Computing (ICIC), 2021, pp. 1–5, doi: 10.1109/ICIC54025.2021.9632910.

I. Fawwaz and A. Winarta, “Penerapan algoritma dynamic programing pada pergerakan lawan dalam permainan police and thief,” Journal Of Informatics and Telecommunication Engineering, vol. 2, no. 2, pp. 114–121, Jan. 2019, doi: 10.31289/jite.v2i2.2169.

D. M. Utama, A. K. Garside, and H. Pamungkas, “Model program dinamis untuk lot size multi item dengan kendala kapasitas gudang,” J@ti Undip J. Tek. Ind., vol. 14, no. 1, p. 21, 2019, doi: 10.14710/jati.14.1.21-26.

M. Anshar, S. Abadi, Y. Yuliana, and M. F. Azdima, “Optimisasi penjadwalan pembangkit listrik untuk sistem sulselbar dengan metode dynamic programming,” Jurnal Teknik Mesin Sinergi, vol. 16, no. 2, pp. 197–204, 2019, doi: 10.31963/sinergi.v16i2.1515.

A. Desrianty, H. Prassetiyo, and L. Mahardini, “Model optimisasi lot produksi dengan pertimbangan biaya kualitas pada sistem produksi multistage,” Teknoin, vol. 22, no. 9, 2016, doi: 10.20885/teknoin.vol22.iss9.art3.

A. Zuserain, W. Winarno, B. Nugraha, and A. Momon, “Analisa optimalisasi keuntungan dengan integer linear programming dan metode branch and bound pada toko bunga QuinnaStory,” J. Ind. Serv., vol. 6, no. 2, p. 99, 2021, doi: 10.36055/62003.




DOI: http://dx.doi.org/10.36055/jiss.v7i2.13911

Refbacks

  • There are currently no refbacks.


  is supported by