Optimal Transshipment Route Planning Method Based on Deep Learning for Multimodal Transport Scenarios

Abstract

The optimal path problem is an important topic in the current geographic information system (GIS) and computer science fields. The Dijkstra algorithm is a commonly used method to find the shortest path, which is usually used to find the least cost path from a single source. Based on the analysis and research of the traditional Dijkstra algorithm, this paper points out the problems of the Dijkstra algorithm and optimizes it to improve its storage capacity and operation efficiency. Then, combined with the traffic elements, a new network-based optimal path planning method is established. However, the existing network is far from actual operation in terms of the expansion of the transportation network, the uncertainty of the transportation environment, and the differences in the transportation area. Therefore, this paper proposes an optimal transshipment path planning method based on deep learning, which is oriented to multimodal transportation scenarios. This paper mainly introduces the intelligent transportation system and intelligent navigation system, and then conducts in-depth research on optimal path planning. This paper also uses the deep neural network algorithm to optimize the calculation, and finally analyzes its use and application. Simulation experiments were also performed to analyze the relationship between energy consumption, emissions, speed, load cost, and other factors under the optimal path. The final experimental results show that within the range of the emission limit of [100,200], the emission is 50%, the emission is less than 100%, but the emission is higher than 75%. In [100,200], 75% of the loading rate emits no less than 100%. In [200,300], the 50% and 100% emissions are the same. This also means that the emissions are the same but the paths are not necessarily the same.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 13 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.