Abstract
Effective Solutions to the Transport Distribution of Material by the Mayer Method
Highlights
Vehicle routing problem or traveling salesman problem (TSP) deals with the issue of several places operation, the route begins from one starting point, and after accomplishing the individual places operation, vehicle returns to the starting point
Exact methods include the method of linear integer programming, brute force method of examining every possible permutation, branch-and-bound methods, gradual improvement algorithms analogous to techniques of linear programming
For the current state of goods deliveries, distribution costs for using external carriers are at the value of CZK 135960 per week
Summary
Vehicle routing problem or traveling salesman problem (TSP) deals with the issue of several places (stations) operation, the route begins from one starting point, and after accomplishing the individual places operation, vehicle returns to the starting point. Each station can be operated only once, the order of stations is not determined, but the objective is to find the shortest possible route. Vehicle routing problem deals with the most economical distribution of products from suppliers to customers in order to meet their requirements (delivery date, etc.) [3,17,29]
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 callMore From: Advances in Science and Technology Research Journal
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
