We present an optimization procedure for solving the vehicle routing problem with a fixed heterogeneous fleet of vehicle. We want to minimize the passage price. We look and probe these methods: minimal element, Vogel’s Approximation and heuristic. The modeling vehicle routing problem is based on mathematical formulation. This paper present very well known problems – TSP Traveling Salesperson Problem and M-TSP. Vehicle routing problem is liked M-TSP with some specification, vehicle with a fixed carrying capacity must deliver order of goods to n customers from a single depot. Knowing the distance between customers, the problem is to find tours for the vehicles in such a way that: the total distance traveled by the vehicles is minimized, only one vehicle handles the deliveries for a given customer, the total quantity of goods that a single vehicle delivers cannot be larger than cars capacity.