The Capacitated Vehicle Routing Problem (CVRP)is defined on a graph (V, A). The nodes set correlate with the set of customer 1 to n (number 0 representtodepot)and an arc set A is the possible route between nodes. The route between every two nodes in the tour network is consist of set A, each arc (I, j) A with the distance dij. The distance from ito j is equal to the distance from j to I (symmetric distance)and the distance from i to i is zero. The fleet of vehicle is N with each vehicle has a capacity Q, which serve each customer with demand dij. This paper use symbols which is relevantto binary decision