基于交通网络图算法的驮背运输路径选择研究

Route Selection of Piggyback Transport Based on Traffic Network Graph Algorithms

论文从驮背运输的政策背景和发展现状入手,分析了现代运输行业的未来趋势,即全球性与跨区域性的经济贸易活动越来越普及,联运组织模式是大势所趋。论文采用交通网络图模拟运输节点与线路的连接形式,将实际运行过程中的各项影响成本做了函数分析,重点提出时间成本、费用成本和交通环境影响成本三个参数。在算法上,论文将两种运输方式单独分开,将模型中首末点和转运点的成本拟化成一条虚拟的线路,形成符合传统最短路Floyd算法的网络图形,并采用计算机编程求得最优方案的结果组合。

In this study,the development of the modern transport industry is analyzed,starting from the policy background and development status of piggyback transport.Global and cross-regional economic and trade activities are becoming more popular,and the need for a multimodal transport organization model is vital.In this study,a transportation network graph is used to simulate the connection between the transportation nodes and lines,and subsequently,the influence cost in the actual operation process is analyzed.Three parameters(time cost,expense cost,and traffic environment influence cost)are proposed.In the algorithm,the two modes of transportation were separated,and the cost of the first and last points and transshipment points were simulated in the model in a virtual line.The paper forming network graphics conforming to the traditional shortest path Floyd algorithm was determined,and computer programming was used to obtain the optimal combination of the results.