Abstract
The article "Optimization of Distribution Routes by way of the Multilevel Approach to the Traveling Salesman Problem" is concerned with the optimization of the distribution routes. The goal is to use the obtained data to try to optimize and propose alternatives of the circular routes for the company Vltavotynske lahudky. For implementing this task, the principle of the module for solving the transport-related tasks was used. This module was developed by the Department of the Operational and System Analysis of the Czech University of Life Sciences in Prague.
Highlights
The Vltavotynske lahudky company operates a total of seven lines, with one driver and one vehicle allocated to each of them
Line No 5 starts at Tyn nad Vltavou where the driver loads the required amount of products and he drives to the consequent places listed in the table
Sixth step: Final solution If we do not find the optimum solution, we will repeat the line coverage process until we find the optimum solution
Summary
The Vltavotynske lahudky company operates a total of seven lines, with one driver and one vehicle allocated to each of them. After the last stop the driver returns back to the initial point (Tyn nad Vltavou) [7 - 9]. Line No 5 starts at Tyn nad Vltavou where the driver loads the required amount of products and he drives to the consequent places listed in the table. Optimization of Distribution Routes by way of the Multilevel Approach to the Traveling Salesman Problem. In this type of problems, there is a single supplier (consumer) who distributes (loads) the goods to the places of consumption. The connection between the identical points is unacceptable; there are prohibitive rates on the main diagonal of the matrix [10 - 14]
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
