The vehicle routing problem (VRP) is associated with the problem of transport logistics and considered to be a generalized solution of the traveling salesman problem (TSP). Both of these problems belong to the class of NP-hard problems. Exact methods are effective in finding optimal solutions, however they require considerable computing times and machine outlays while increasing number of customers. Consequently, the development of approximate algorithms that give a satisfactory solution in polynomial time is relevant. In this paper, the capacitated multi-vehicle routing problem is considered. A set of customers to be served by identical vehicles, moreover each customer must be serviced by one vehicle once. Two heuristic algorithms are applied using test examples: the Ant Colony Optimization (ACO) and the Simulated Annealing method (SA) for various ways of distributing consumers to vehicles.