The Vehicle Routing Problem (VRP) consists of the routing of capacitated vehicles over a network of customers with specific demands, beginning and ending at a central depot. The objective is to design a set of vehicle routes minimizing travel cost incurred in servicing the customers. Existing models on the optimal routing of vehicles have not considered imposition of vehicle time windows. This feature is present in practice, coming in the form of crew shifting and government regulations regarding the use of heavy vehicles. Another feature of this study is the possibility of having more than one trip in a period. This study also considers the cost of not utilizing all the vehicles, other studies considered the non-utilization of vehicles but...