Park cargo transportation route planning system and method

Abstract

The invention discloses a park cargo transportation route planning method. The method comprises the steps: obtaining the distance between a starting park and a target park according to the longitude and latitude of the starting park and the target park; obtaining a plurality of routes between the starting park and the target park according to the cost, time and transportation mode required by the routes; carrying out target station evaluation on the route of the random tree by adopting a path planning RRT algorithm based on graph search, and obtaining a minimum station in an evaluation function; adopting a regression function to constrain and traverse the random tree to obtain new nodes of the random tree; and repeating traversal to obtain the optimal route for cargo transportation in the park. Through the scheme, the system and method have the advantages of simple logic, accuracy, reliability and the like, and have very high practical value and popularization value in the technical field of transportation route planning.

Description

technical field [0001] The invention relates to the technical field of transportation route planning, in particular to a planning system and method for cargo transportation routes in parks. Background technique [0002] With the rapid development of economic globalization, the logistics industry has become an important part of business links. Logistics refers to the whole process of planning, implementing and managing from the place of origin of goods to the place of consumption of goods through transportation and distribution in order to meet the needs of customers at the lowest cost. At present, in the existing technology, for the convenience of transportation for some bulk materials and raw materials, etc., the materials are usually transported from one park to another park first, and then further transported in small sections, and the distribution between the parks In China, all logistics activities are usually carried out on routes and nodes, therefore, the rationaliza...

AI Technical Summary

Problems solved by technology

The disadvantages of this technology are: the search time is long, the number of iterations is large, and the search path strategy is a random sampling search, which also leads to useless search of blank areas in the route area, making the efficiency low

The disadvantage of this technology is that the path planning scheme is single and applied in a fixed working environment. If the DEM diagram of the working environment and the actual application environment change, the single planning scheme will lead to deviations in the target path.

Images