Optimization of Transportation Routes between a Chosen Company and Its Clients

This thesis deals with the adjustment of the current distribution routes of the company CHEMIE STAR Ltd. and at the same time with a creating of new distribution routes with the aim of economic savings, which is achieved through a reduction in the length of routes and the time required for the routes. In the introductory theoretical part of the work the logistics is defined, its functions, importance and influence on the enterprise. And this part also provides an overview of methods dealing with the traveling salesman problem. In the practical part the optimization of the input data into the model at the current routes is performed, where there is always selected the cheapest route between the two nodes using unit costs. Subsequently, the methods solving the traveling salesman problem are applied, namely the method of the Nearest neighbor, Vogel approximation method and Clark-Wright method. The layout of the new routes, which is limited in capacity by car and the purchasers requirements, is done using Mayer method and Sweep algorithm and with the subsequent application of the method solving the problem of traveling salesman problem. In the chapter evaluation of the results and recommendation all obtained outcomes are compared and interpreted