The purpose of this paper is to develop a new heuristic algorithm for vehicle routing problem. The algorithm is composed of two steps. First step is to make a initial solution using sweeping algorithm. Second step is to improve initial solution for optimal solution using node exchange algorithm and tabu search algorithm. We have proven that our algorithm has produced better results than solutions obtained by saving algorithm and genetic in ten example problems with different unit size.