APLIKASI ALGORITMA BRANCH AND PRICE DENGAN MODEL SYMMETRIC CAPACITATED VEHICLE ROUTING PROBLEM (SCVRP) UNTUK MEMINIMALKAN RUTE KENDARAAN PENGANGKUT SAMPAH WILAYAH ILIR TIMUR II
Daftar Isi:
- The limited capacity of garbage transport vehicles and the lack of capacity of polling stations to collect garbage is the cause of landfill at various points. The landfill at certain points are the priority of polling stations visited first without considering the minimization of the distance. In the field there is also the use of garbage transport vehicles that overlap in the one WK (working area) that transports garbage in other WK, resulting in the route of garbage transport vehicles not being optimal. Therefore, it is necessary to optimize the route of travel that is traversed by garbage transport vehicles. The object of this research is TPS in Ilir Timur II Subdistrict. Ilir Timur II Subdistrict has seven polling stations which are divided into four WK, each WK is handled by a garbage transport vehicle. This research models the problem of garbage transport vehicle routes in the SCVRP model and is solved by the Branch and Price algorithm. Based on the results and discussion, the minimum total distance was obtained, for WK 1 was 69 km, WK 2 was 72.4 km, WK 3 was 33.8 km, and WK 4 was 72.6 km. The route of WK 1, WK 2, and WK 4 transport vehicles is optimal if handled by two garbage transport vehicles, while WK 3 is optimal if handled by a garbage transport vehicle.