OPTIMASI RUTE PENGANGKUTAN SAMPAH DENGAN METODE VEHICLE ROUTING PROBLEM WITH TIME WINDOW MENGGUNAKAN BINARY INTEGER PROGRAMMING (Studi Kasus di Dinas Kebersihan dan Pertamanan Kota Cilegon)
| Main Author: | Sutrisno, Dwi |
|---|---|
| Format: | Thesis NonPeerReviewed Book |
| Bahasa: | ind |
| Terbitan: |
, 2014
|
| Subjects: | |
| Online Access: |
https://eprints.untirta.ac.id/11319/1/OPMTIMASI%20RUTE%20PENGANGKUTAN%20SAMPAH%20DENGAN%20METODE%20VEHICLE%20ROUTING%20PROBLEM%20WITH%20TIME%20WINDOW%20MENGGUNAKAN%20BINARY%20INTEGER%20PROGRAMMING.pdf https://eprints.untirta.ac.id/11319/ https://ft.untirta.ac.id |
Daftar Isi:
- The development of a region characterized increasing the community in the area, this is also increasing the daily activities in the environment. So physically can be seen from waste generated. Waste transportation is a sub-system that targeted to carrying trash from the location or the removal of waste sources directly to Landfill (TPA). This Research aims to determine the route of waste transportation by armroll in Cilegon city with Vehicle Routing Problem (VRP) method with time window constraint. Locations that are transported total 36 locations and total armroll vehicle available is 10 units. This research uses the model formulation of Binary Integer Programming to solve existing problems. This formulation is done by determining the objective function is to minimize the completion time of vehicle with time window of each vehicle is 420 minutes reduced the travel time from landfill to depot for 53 minute, so time window constraint of vehicle is 367 minute. The result of WinQSB software generates routes for 10 vehicles which do not exceed the time window. Vehicle 1 capable to visit 4 TPS locations with completion time 360 minutes. Vehicle 2 capable to visit 4 TPS locations with completion time 361.4 minutes. Vehicle 3 capable to visit 4 TPS locations with completion time 358.4 minutes. Vehicle 4 capable to visit 3 TPS locations with completion time 345 minutes. Vehicle 5 capable to visit 3 TPS locations with completion time 322.8 minutes. Vehicle 6 capable to visit 3 TPS locations with completion time 323.4 minutes. Vehicle 7 capable to visit 3 TPS locations with completion time 327 minutes. Vehicle 8 capable to visit 3 TPS locations with completion time 345 minutes. Vehicle 9 capable to visit 4 TPS locations with completion time 365 minutes. Vehicle 10 capable to visit 5 TPS locations with completion time 365.8 minutes. Keywords : Route, Vehicle Routing Problem, VRPTW, Integer Linear Programing, Binary Integer Programming, Model Formulation.