PUTRA, HADITRIYONO (2020) OPTIMASI RUTE PENGANGKUTAN SAMPAH DI KECAMATAN JATISAMPURNA DENGAN METODE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS DAN NEAREST INSERTION HEURISTIC. S1 thesis, Universitas Mercu Buana Bekasi.
|
Text
Halaman Judul.pdf Download (27kB) | Preview |
|
|
Text
Abstrak.pdf Download (28kB) | Preview |
|
|
Text
Lembar Pengesahan.pdf Download (144kB) | Preview |
|
|
Text
Surat Pernyataan.pdf Download (543kB) | Preview |
|
|
Text
Kata Pengantar.pdf Download (77kB) | Preview |
|
|
Text
Daftar Isi.pdf Download (28kB) | Preview |
|
|
Text
Daftar Tabel.pdf Download (26kB) | Preview |
|
|
Text
Daftar Gambar.pdf Download (25kB) | Preview |
|
|
Text
Daftar Lampiran.pdf Download (21kB) | Preview |
|
![[img]](https://repository.mercubuana.ac.id/style/images/fileicons/text.png) |
Text
Bab 1.pdf Restricted to Registered users only Download (91kB) |
|
|
Text
Bab 2.pdf Restricted to Registered users only Download (452kB) |
|
|
Text
Bab 3.pdf Restricted to Registered users only Download (249kB) |
|
|
Text
Bab 4.pdf Restricted to Registered users only Download (364kB) |
|
|
Text
Bab 5.pdf Restricted to Registered users only Download (652kB) |
|
|
Text
Bab 6.pdf Restricted to Registered users only Download (28kB) |
|
|
Text
Daftar Pustaka.pdf Restricted to Registered users only Download (77kB) |
|
|
Text
Lampiran.pdf Restricted to Registered users only Download (361kB) |
Abstract
ABSTRAK Unit Pelaksana Teknis Dinas Lingkungan Hidup Kecamatan Jatisampurna merupakan instansi yang bertugas dalam bidang kebersihan di Kecamatan Jatisampurna. Dalam proses operasionalnya, pengangkutan sampah rumah tinggal dilakukan secara door to door (rumah ke rumah) membutuhkan armada kendaraan berjenis dump truck sejumlah 9 unit. Dengan adanya pengalokasian Tempat Penampungan Sampah Sementara (TPSS) yang baru, perlu adanya perancangan rute kendaraan yang optimal untuk meminimasi ongkos total, sehingga pada penelitian ini dilakukan penerapan dengan metode Vehicle Routing Problem with Time Windows dan metode Nearest Insertion Heuristic. Hasil dari penelitian ini diperoleh 5 rute yaitu rute pertama : A, E, F, H, G, A dengan jarak tempuh 32,9 Km dan waktu tempuh 66 menit serta alokasi kapasitas kendaraan 6,7 ton perhari. Untuk rute kedua yaitu : A, D, A dengan jarak tempuh 30 Km dan waktu tempuh 60 menit serta alokasi kapasitas kendaraan 7 ton perhari. Untuk rute ketiga yaitu : A, I, J, A dengan jarak tempuh 33,4 Km dan waktu tempuh 71 menit serta alokasi kapasitas kendaraan 5 ton per 2 hari sekali. Untuk rute keempat yaitu : A, C, A dengan jarak tempuh 32 Km dan waktu tempuh 64 menit serta alokasi kapasitas kendaraan 6 ton perhari. Untuk rute kelima yaitu ; A, B, A dengan jarak tempuh 34 Km dan waktu tempuh 68 menit serta alokasi kapasitas kendaraan 7 ton perhari. Ongkos total transportasi yang digunakan untuk operasional pengangkutan sampah adalah sebesar Rp. 78.667.627,6,-/bulan. Dengan adanya rute yang optimal, maka dapat menurunkan pemakaian jumlah armada dump truck yang sebelumnya 9 unit menjadi 5 unit atau pengurangan emisi gas buang hingga 55%. Kata Kunci : Vehicle Routing Problem with Time Windows (VRPTW), Nearest Insertion Heuristic. ABSTRACT The Technical Implementation Unit of the Jatisampurna District Environmental Service is an agency in charge of cleaning in the Jatisampurna District. In the operational process, the transportation of residential waste is carried out door-todoor requiring a fleet of 9 dump trucks. With the new TPSS allocation, it is necessary to design an optimal vehicle route to minimize total costs, so that in this study the implementation of the Vehicle Routing Problem with Time Windows method and the Nearest Insertion Heuristic method was carried out in this study. The results of this study obtained 5 routes, namely the first route: A, E, F, H, G, A with a distance of 32.9 km and a travel time of 66 minutes and an allocation of vehicle capacity of 6.7 tons per day. For the second route, namely: A, D, A with a distance of 30 km and a travel time of 60 minutes and an allocation of vehicle capacity of 7 tons per day. For the third route, namely: A, I, J, A with a distance of 33.4 km and a travel time of 71 minutes and an allocation of vehicle capacity of 5 tons per 2 days. For the fourth route, namely: A, C, A with a distance of 32 km and a travel time of 64 minutes and an allocation of vehicle capacity of 6 tons per day. For the fifth route, namely; A, B, A with a distance of 34 km and a travel time of 68 minutes and an allocation of vehicle capacity of 7 tons per day. The total transportation cost used for the operation of transporting waste is Rp. 78,667,627,6, - / month. With the optimal route, it can reduce the use of the dump truck fleet from 9 units to 5 units or reduce exhaust emissions by 55%.. Keywords: Vehicle Routing Problems with Time Windows (VRPTW), Nearest Insertion Heuristic.
| Item Type: | Thesis (S1) |
|---|---|
| Call Number CD: | FT/IND 20 093 |
| NIM/NIDN Creators: | 41616310103 |
| Uncontrolled Keywords: | Kata Kunci : Vehicle Routing Problem with Time Windows (VRPTW), Nearest Insertion Heuristic. |
| Subjects: | 000 Computer Science, Information and General Works/Ilmu Komputer, Informasi, dan Karya Umum > 000. Computer Science, Information and General Works/Ilmu Komputer, Informasi, dan Karya Umum > 001 Knowledge/Ilmu Pengetahuan > 001.4 Research; Statistical Methods/Riset; Metode Statistik > 001.43 Descriptive and Experimental Methods/Riset Deskriptif, Metode Eksperimen dan Percobaan Ilmiah |
| Divisions: | Fakultas Teknik > Teknik Industri |
| Depositing User: | siti maisyaroh |
| Date Deposited: | 23 May 2022 05:39 |
| Last Modified: | 23 May 2022 05:39 |
| URI: | http://repository.mercubuana.ac.id/id/eprint/61543 |
Actions (login required)
 |
View Item |
