Demand robust counterpart-open capacitated vehicle routing problem with time windows and deadline (DRC-OCVRPtw,d) model formed and explained in this paper, is the model used to find the minimum distance and the time needed for vehicles to transport garbage in Sukarami Sub-District, Palembang that consists of the time it takes for the vehicle to pass through the route. Time needed to transport garbage to the vehicle is called time windows. Combination of the thoses times is called deadline. The farther the distance passed by vehicle and the more garbage transported, the longer the deadline is needed. This DRC-OCVRPtw,d model is completed by LINGO 13.0 to obtain the optimal route and time deadline for Sukarami Sub-District. The model shows that the improved model of open vehicle routing problem involving the robustness, time windows and deadline can achieve the optimal routes that enable driver to save operational time in picking up the garbage compared to similar problem not involving no-time windows and deadline stated in previous research.

Robust Counterpart-Open Capacitated Vehicle Routing Problem with time windows and deadline (RC-OCVRPTWD) model which was formed and explained in this paper, is a model used to design solid waste control routes to minimize the distance and time needed for vehicles to complete waste transportation in Kalidoni Sub-District, Palembang. The completion of this route is expected to be able to overcome the occurrence of solid waste accumulation in Kalidoni District, Palembang that involved two characteristics the time that takes for the vehicle to across the route and the time needed to transport waste to the vehicle, which is called time windows. The second combination of time above is deadline. Waste that are transported every day are divided into working areas where the distance of temporary disposal to other disposal in one working area and the volume of waste transported will affect the length of deadline needed. This RC-OCVRPTWD model uses the LINGO 13.0 application to obtain optimal routes and deadlines. The results show that the working route for Kalidoni Sub-District in working area 1 is completed within 28.6 km and a deadline of 2 hours 51 minutes. In working area 2, is with a distance of 23.6 km and a deadline of 1 hour 42 minutes, and in working area 3 is with a distance of 38 km and a deadline of 3 hours 16 minutes.