PENENTUAN RUTE OPTIMAL PENGANGKUTAN SAMPAH MENGGUNAKAN METODE CLARKE & WRIGHT SAVING MATRIX, NEAREST NEIGHBOR, NEAREST INSERT, DAN FARTHEST INSERT (STUDI KASUS: DINAS LINGKUNGAN HIDUP KOTA YOGYAKARTA)

Zulfian Hafni Nazar, NIM.: 16660034 (2021) PENENTUAN RUTE OPTIMAL PENGANGKUTAN SAMPAH MENGGUNAKAN METODE CLARKE & WRIGHT SAVING MATRIX, NEAREST NEIGHBOR, NEAREST INSERT, DAN FARTHEST INSERT (STUDI KASUS: DINAS LINGKUNGAN HIDUP KOTA YOGYAKARTA). Skripsi thesis, UIN SUNAN KALIJAGA YOGYAKARTA.

Preview	Text (PENENTUAN RUTE OPTIMAL PENGANGKUTAN SAMPAH MENGGUNAKAN METODE CLARKE & WRIGHT SAVING MATRIX, NEAREST NEIGHBOR, NEAREST INSERT, DAN FARTHEST INSERT (STUDI KASUS: DINAS LINGKUNGAN HIDUP KOTA YOGYAKARTA)) 16660034_BAB-I_IV-atau-V_DAFTAR-PUSTAKA.pdf - Published Version Download (2MB) | Preview
	Text (PENENTUAN RUTE OPTIMAL PENGANGKUTAN SAMPAH MENGGUNAKAN METODE CLARKE & WRIGHT SAVING MATRIX, NEAREST NEIGHBOR, NEAREST INSERT, DAN FARTHEST INSERT (STUDI KASUS: DINAS LINGKUNGAN HIDUP KOTA YOGYAKARTA)) 16660034_BAB-II_sampai_SEBELUM-BAB-TERAKHIR.pdf - Published Version Restricted to Registered users only Download (3MB) | Request a copy

Abstract

Dinas Lingkungan Hidup (DLH) has the task of carrying out regional government affairs based on the principle of autonomy and assistance in the environmental field. One of the activities carried out by the DLH in the city of Yogyakarta is to transport garbage from several points of TPS around the community and brought to the landfill.. In its implementation, DLH has several factors that influence the determination of routes in the transportation of waste. These factors include the number of vehicle fleets, the volume of waste, vehicle capacity, distance traveled, and working time. The aim of this research is to find the best route in the process of transporting waste by DLH. In solving these problems, there are several methods that can be used, including Clarke & Wright Saving Matrix, Nearest Neighbor, Nearest Insert, and Farthest Insert to obtain an optimal route. Based on the comparison of the results between methods, the distance generated using the nearest neighbor method is 740.04 Km, nearest insert is 759.83 Km, and farthest insert is 756.93 Km. While the travel time generated using the nearest neighbor method is 1737.07 minutes, nearest insert is 1761.055 minutes, and farthest insert is 1762.405 minutes. The method that produces the most optimal savings is the nearest neighbor with a mileage savings of 180.53 Km and a travel time of 248.79 minutes.

Share this knowledge with your friends :

Actions (login required)

View Item