The most fundamental and well-studied routing problem is without doubt the Traveling Salesman Problem (TSP) while the Vehicle Routing Problem (VRP) is a generalization of the TSP. The VRP is to determine m vehicle routes, where a route is a tour that begins at the depots, visits a set of customers in a given order and returns to the depots. All customers must be visited exactly once and the total customer demand of a route must not exceed the vehicle capacity with the objective of minimizing the overall distribution costs. This paper presents various issues concerning VRP, focusing on a dedicated vehicle routine problem (DVRP), which is one variation in the problem. The VRP and its dedicated counterparts, the DVRP are introduced with the objective of finding the minimum routing traveled for one vehicle within a predetermined network using deterministic cost and quantity. In solving the VRP, its initial feasible solution does have a role in determining the final optimal solution. Here, two procedure algorithms namely the least cost and the demand priority are proposed as the initial feasible solution for the DVRP.