摘要：The article deals with the approach to modeling the road transport movement in large cities (with a population of over 100 thousand people) for the delivery of goods from a large warehouse to stores belonging to a trading network company, with the task of optimizing these movements. The main purposes of this optimization task are: to reduce the transportation time; to conduct a rational distribution of vehicles; to reduce the number of required vehicles involved in these transportations; to reduce operating costs for the maintenance of vehicles. The problem statement and its solution on the basis of heuristic algorithms of the Traveling Salesman Problem are given. The article presents a comparative analysis of the most popular methods for solving the Traveling Salesman Problem (Greedy Approach, Modified Greedy Approach, Minimum Spanning Tree, Monte Carlo Simplification Model, Ant Colony Optimization, Algorithm of Little) on the basis of experimental research and simulation. As a result of the analysis, it is proposed to use the Algorithm of Little for optimizing of road transport movement in the delivery of goods. The article provides an example of solving a specific problem using the developed calculation procedure and a computer program “Traveling Salesman Problem” (developed in Pascal in the software environment Delphi 7).
其他摘要：The article deals with the approach to modeling the road transport movement in large cities (with a population of over 100 thousand people) for the delivery of goods from a large warehouse to stores belonging to a trading network company, with the task of optimizing these movements. The main purposes of this optimization task are: to reduce the transportation time; to conduct a rational distribution of vehicles; to reduce the number of required vehicles involved in these transportations; to reduce operating costs for the maintenance of vehicles. The problem statement and its solution on the basis of heuristic algorithms of the Traveling Salesman Problem are given. The article presents a comparative analysis of the most popular methods for solving the Traveling Salesman Problem (Greedy Approach, Modified Greedy Approach, Minimum Spanning Tree, Monte Carlo Simplification Model, Ant Colony Optimization, Algorithm of Little) on the basis of experimental research and simulation. As a result of the analysis, it is proposed to use the Algorithm of Little for optimizing of road transport movement in the delivery of goods. The article provides an example of solving a specific problem using the developed calculation procedure and a computer program “Traveling Salesman Problem” (developed in Pascal in the software environment Delphi 7).
