The using of solver software and vehicle routing for the traveling salesman problem

Krstev, Dejan and Pop-Andonov, Goran and Krstev, Aleksandar and Dzidrov, Misko and Krstev, Boris and Pavlov, Sashe (2014) The using of solver software and vehicle routing for the traveling salesman problem. International Journal for Science, Technics and Innovations for the Industry MTM (Machines, Tecnologies, Materials), 22 (9). pp. 38-42. ISSN 1310 – 3946


Download (5Mb) | Preview


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.

Item Type: Article
Subjects: Natural sciences > Computer and information sciences
Engineering and Technology > Mechanical engineering
Divisions: Faculty of Natural and Technical Sciences
Depositing User: Aleksandar Krstev
Date Deposited: 11 Aug 2014 12:56
Last Modified: 11 Aug 2014 12:56

Actions (login required)

View Item View Item