Penentuan Rute Distribusi Makanan Ringan (Snack) Dengan Pendekatan Vehicle Routing Problems
Studi kasus pada UD. NNR JAYA di Bojonegoro
DOI:
https://doi.org/10.36815/jurva.v2i1.1959Keywords:
Optimization, Mixed Integer Linear Progamming, Algoritme Sweep, CVRPTWAbstract
UD. NNR Jaya is a business engaged in the production of snacks that produce Mie Lidi, Macaroni, Soybeans in Sumuragung Village, Bojonegoro Regency. In this study, the author determines the route using a sweep algorithm approach used to cluster all customers and then creates a route from the results (cluster) to find the minimum total distance using a mathematical model with the concept of MILP (mixed integer linear programming) using Lingo 17.0x64 software. Which is used to minimize costs by finding the best route without exceeding the existing vehicle capacity, the mixed integer linear programming model approach can save costs of Rp. 368,707 or save 5.46%. As for the alternative distance, it saves 5.42% and time saves 4.51%.
References
Andika, Dwi Aji. (2019). Vehicle Rounting Problem, jurnal optimus teknik indutri. Univesitas indraparsta pgri.
Cahyaningsih, W. K., Sari, E. R., & Hernawati, K. (2015). Penyelesaian Capacitated Vehicle Routing Problem (CVRP) Menggunakan Algoritma Sweep Untuk Optimasi Rute Distribusi Surat Kabar Kedaulatan Rakyat. Seminar Nasional Matematika Dan Pendidikan Matematika.
Bowersox, D. J. (2002). Integrasisistem-sistem manajemen distribusi fisik dan manajemen material. Jakarta: PT. Bumi Aksara.
Toth & Vigo. (2002). The Vehicle Routing Problem. Florida: Society and Mathematics. Wibisono. (2018). Logika Logistik. Surabaya: GrahaIlmu.
Ainia, Qurrotun. (2020). Optimasi, Distribusi, Mixed Integer Linear Programing, Algoritma Sweep, CVRPTW, Biaya, Jarak, Waktu. Fakultas teknik.
Hestyantama, Deni (2020) Penentuan Rute Distribusi Dengan Pendekatan Heterogeneous Vehicle Routing Problem Pada Pt. Pioneerindo Gourmet International Tbk Gudang CFC Cabang Surabaya. Undergraduate thesis, Universitas 17 Agustus 1945 Surabaya.
Hayati, Enty Nur. (2010). "Aplikasi Algoritma Branch and Bound untuk Menyelesaikan Integer Progamming". Ilmiah Dinamika Teknik 4, 1.
Martono. (2018). Manajemen Logistik. Jakarta: PT. Gramedia Pustaka Utama. Nasution. (2006). Manajemen Transportasi . Yogyakarta: Andi Offset.
Nuha, H., Wati, P. E. D. K., & Widiasih, W. (2018). A Comparison of Exact MethodMetaheuristic Method in Determination for Vehicle Routing Problem. MATEC Web of Conferences, 204, 2017.
Salim, A. (2012). Manajemen Transportasi. Jakarta: PT. Rajagrafindo Persada.
Wibisono. (2018). Logika Logistik. Surabaya: Graha Ilmu.
