The possibility of reducing logistic costs for transportation by solving the traveling salesman problem is considered. The algirythm for solving the problem using computational power of OpenOffice Calc's component "Solver" is suggested. On the basis of the proposed algorythm practical situatuion is solved and best route is formed. The conclusion about expediency of application of this method to solve practical problems is given.

Keywords: logistics, logistic approach, the traveling salesman problem, the objective of the traveling salesman, NP-difficult task, best route, optimization of transport, minimization of transportation costs, OpenOffice Calc, component "Solver"