This article presents new heuristics concept for solving Vehicle Routing Problem with Time Window. New concept, which is a skip concept, derives from a solution of the traditional sweep and nearest neighbor technique, which gives poor vehicle's utilization. Hence, skip sweepalgorithm and skip nearest neighbor search focus on increasing the vehicle's utilization. The case study of cash distribution has been applied to proof efficiency of the skip concept. New concepts have been resulting inusing the same amount of vehicle as the traditional one. The favorable result is the increasing of the vehicle's utilization. The decreasing of total travel time, which is an unexpected result, has found from the case study. It turns to be a favorable result since it associates to the variable cost of fuel.