This project involves the application of Heuristics for solving vehicle routing problems of Ubon Ratchathani Warithap limited partnership. With the uncertain demands of customers and asymmetric distances, there are 3 method for solution. The first method is to construct a solution of Nearest Neighbor. The second method is to the solution obtained from Modified Nearest Neighbor Heuristic . The final method is to the solution with the utilization of Lingo program. The solutions three method are compared to the 249.169 kilometer current route. The results show that the Nearest Neighbor can reduce total distance to 185.265 kilometers. The Nearest Neighbor Heuristic can reduce total distance to 167 kilometers. The utilization of Lingo program can reduce total distance to 127.535 kilometers.