A bakery company in Bandung produces and distributes a variety of bread to a number of shops in Bandung and Jakarta. The company is intended to design a route to get a route with a minimum time. The design of the route can be performed by using the Saving Matrix method which performs route design considering the highest saving. Considering the capacity of the vehicles used and the demand from each shop every day, the resulting routes can be dfferent every day but will remain the same every week. To get a minimum savings, it is necessary to sort the route based on the minimum time using the Nearest Neighborhood method and Permutation theory. The routing results in the company show that Saving Matrix and Nearest Neighborhood with Permutation is capable to create a more than 50 percent saving in time and distance compared to the route currently they are using.