Abstract :
Rubbish problem is a major problem in Palembang city that should be handled seriously by all society, government, and related department. In this case, the Dinas Kebersihan dan Keindahan (DKK) of Palembang. The activity of rubbish transportation in Palembang is one of the applications of Demand Robust Capacitated Vehicle Routing Problem (DRC-OCVRP) in transporting rubbish in Ilir Barat II district, Bukit Kecil district, Plaju district, and Sukarami district by applying preprocessing and probing technique to obtain the simplest DRC-OCVRP model. The
solution is conducted by using LINGO software. The result shows that the optimal routes in those districts after applying the techniques are the same routes. In addition, we obtain the reduction of constraints, variables and the reduction of iteration numbers. For Ilir Barat II district the reducing is mostly done on the working area 1 (WK 1) that is reducing as much 15 variables and 7 constraints of the initial number of variables as much as 83 and 46 constraints. For Bukit Kecil district the reducing is mostly done on the working area 2 (WK 2) and working area 4 (WK 4) that is reducing as much 13 variables and 9 constraints of the initial number of variables as much as 64 and 117 constraints. For Plaju district the reducing is mostly done on the working area 2 (WK 2) that is reducing as much 7 variables and 7 constraints of the initial number of variables as much as 25 and 46 constraints. For Sukarami district the reducing is mostly done on the working area 5 (WK 5) that is reducing as much 8 variables and 7 constraints of the initial number of variables as much as 25 and 46 constraints