Penentuan Rute Pengantaran Dan Penjemputan UangNasabah Menggunakan Metode Vehicle Routing ProblemDengan Algoritma Nearest Neighbor Untuk MeminimalkanBiaya Operasional Di Perusahaan Jasa Keuangan

NURSETO, MOHAMAD (2020) Penentuan Rute Pengantaran Dan Penjemputan UangNasabah Menggunakan Metode Vehicle Routing ProblemDengan Algoritma Nearest Neighbor Untuk MeminimalkanBiaya Operasional Di Perusahaan Jasa Keuangan. S1 thesis, Universitas Mercu Buana Bekasi.

Preview	Text 1. HALAMAN JUDUL.pdf Download (101kB) | Preview
Preview	Text 2. HALAMAN PERNYATAAN.pdf Download (80kB) | Preview
Preview	Text 3. HALAMAN PENGESAHAN.pdf Download (73kB) | Preview
Preview	Text 4. ABSTRAK.pdf Download (99kB) | Preview
Preview	Text 5. KATA PENGANTAR.pdf Download (81kB) | Preview
Preview	Text 6. DAFTAR ISI.pdf Download (112kB) | Preview
Preview	Text 7. DAFTAR TABEL.pdf Download (95kB) | Preview
Preview	Text 8. DAFTAR GAMBAR.pdf Download (85kB) | Preview
	Text 9. BAB I.pdf Restricted to Registered users only Download (122kB)
	Text 10. BAB II.pdf Restricted to Registered users only Download (196kB)
	Text 11. BAB III.pdf Restricted to Registered users only Download (155kB)
	Text 12. BAB IV.pdf Restricted to Registered users only Download (932kB)
	Text 13. BAB V.pdf Restricted to Registered users only Download (145kB)
	Text 14. BAB VI.pdf Restricted to Registered users only Download (99kB)
	Text 15. DAFTAR PUSTAKA.pdf Restricted to Registered users only Download (108kB)

Abstract

ABSTRAK Vehicle routing problem (VRP) adalah sebuah ilmu yang menjadi sebuah solusi dari permasalah yang penting pada sistem distribusi dan transportasi yang bertujuanuntuk meminimalkan jarak tempuh total rute kendaraan untuk mengurangi biayapengoperasian kendaraan seminimal mungkin. Sebagai perusahaan jasa pengelolakeuangan yang memiliki pusat distribusi uang nasabah di Jakarta, memiliki potensi penghematan waktu dan biaya yang berasal dari rute pengantaran dan penjemputanyang tidak mempertimbangkan efisiensi jarak, permasalahan yang sering muncul dalam operasional seperti bagaimana meminimalkan total biaya transportasi tanpamengorbankan kepuasan nasabah dengan menciptakan waktu penyelesaian dengancepat yang dapat mengurangi risiko penurunan kualitas jasa layanan. Hasil dari penerapan metode nearest neighbor pada penelitian ini didapatkan penurunan biayaoperasional berdasarkan perhitungan pengolahan data dengan sebelum dilakukanpenelitian dan setelah penerapan metode, sebesar Rp. 388.006 (13,5 %) dari biayaoperasional untuk 4 trip penjemputan dan pengantaran uang nasabah pada tanggal 14januari 2020 sebesar Rp. 2.870.616 menjadi Rp. 2.482.610 dengan penerapan metodenearest neighbor. Kata kunci: Vehicle Routing Problem, Nearest Neighbor, Pengantaran danPenjemputan , Rute trip. ABSTRACT Vehicle routing problem (VRP) is a scientific methods that becomes a solutionto solve commons problems in distribution and transportation systems which aim tominimize the total distance traveled by the vehicle route to reduce vehicle operatingcosts to a minimum. As a financial management service company that has a customermoney distribution center in Jakarta, has the potential to save time and costs fromdelivery and pick-up routes that do not consider distance efficiency, problems that often arise in operasions such as how to minimize total transportation costs without sacrificing customer satisfaction. by creating a fast turnaround time which can reducethe risk of deteriorasion in service quality. The results of the application of thenearest neighbor methods in this study obtained a route that has reduction inoperasional costs based on the calculation of data processing before the research wascarried out and after the application of the method, amounting to Rp. 388,006 (13.5%) of operasional costs for 4 trips to pick up and deliver customer money on January 14, 2020, amounting to Rp. 2,870,616 to Rp. 2.482.610 by applying the nearest neighbor method. Keywords: Vehicle Routing Problem, Nearest Neighbor, Delivery and Pick-up, TripRoutes.

Actions (login required)

View Item