Abstract

The traveling salesman problem (TSP) is one of the most studied problems in management science. Optimal approaches to solving traveling salesman problems are based on mathematical programming. But in reality, most TSP problems are not solved optimally. When the problem is so large that an optimal solution is impossible to obtain, or when approximate solutions are good enough, heuristics are applied. Two commonly used heuristics for the traveling salesman problem are the nearest neighbor procedure and the Clark and Wright savings heuristic.

In this paper will be present using of the solver software and principles of TSP for optimal solution of vehicle routing for domestic bottled water and different juices in the different parts of the Republic of Macedonia.