Affiliations: [a] School of Mathematical Sciences, Anhui University, Hefei, Anhui, China
| [b] Jianghuai College, Anhui University, Hefei, Anhui, China
| [c]
Tarrant County College, Texas, USA
Correspondence:
[*]
Corresponding author. Shuangdong Li, School of Mathematical Sciences, Anhui University, Hefei, Anhui, China. E-mail: lisd@ahu.edu.cn.
Abstract: Path planning is an important part of logistics management and an important part of intelligent transportation system. The shortest path problem in graph theory is the theoretical basis of path planning. On this basis, this paper studies the application of graph theory in logistics management and transportation linkage and its computer-aided model design. In order to give full play to the advantages of the optimized road network model, this paper adopts the matching path planning algorithm and control strategy. The optimized road network model puts forward a partition method based on data quantity and connectivity principle and realizes the equalization of partition data quantity. Compared with the general road network model, the established road network partition is more reasonable and more in line with the actual requirements of the path planning algorithm. Through the research in this paper, it provides a reasonable and effective solution for practical application, which is innovative and practical.
