Garbage is produced daily in Surabaya. This work aims to find the effective garbage-collecting route in order to free Surabaya from garbage pile. Several factors needed to be examined are existing garbage colleting system and transportation time by traffic condition. Using this information, a model of Vehicle Routing Problem is developed. The model is called Time-dependent Vehicle Routing Problem with Multiple Trips and Intermediate Facility (TDVRPMTIF).Routes are applied to 70 trucks for 97 Temporary Dumping Site (TPS) in Surabaya, which consists of 19 locations in Central Surabaya, 15 locations in West Surabaya, 15 locations in North Surabaya, 36 locations in East Surabaya, and 12 locations in South Surabaya. The completion of garbage collection route TDVRPMTIF is using sequential insertion algorithm in 3 variants working time, 8-hours, 9-hours and 10-hours. These 3 variants working time do not produce less total routes assigned to the truck. This indicates Surabaya’s garbage collection have insufficient quantity of trucks to complete the problem.Several alternatives are proposed to solve the problem. First alternative is maintaining 8-hours working time and adding 11 trucks to complete the task. Second choice is adjusting the working time to 9 hours with the addition of 7 trucks. The third one is optimizing the existing 70 trucks with 10-hours working time
