Business School, Hohai University, Nanjing 211000, China.
School of Transportation, Southeast University, Nanjing 211189, China.
Sensors (Basel). 2022 Jun 28;22(13):4887. doi: 10.3390/s22134887.
This paper mainly studies the joint decision of transportation mode and path in the multi-mode transportation network to provide the optimal plan for freights. This paper constructs a multi-mode transportation network system by setting virtual connections between networks with different transportation modes. The Dijkstra and multi-objective optimization algorithms are used to select the path in the network. After determining the optimal path, the paths' time, cost, and risk functions are established. The multi-objective function is converted into a single objective function by setting constraint conditions through the analytic hierarchy process. Then, the function is optimized by using the gradient descent method. Finally, the transportation plan for the case of chemical freights is formulated by using the above algorithms. The results show that the proposed algorithm can successfully find the solution for the joint decision of transportation mode and path in the complex network. After a quantitative analysis of the planned effect, the optimization actions of changing the initial transportation time and adjusting the upper limit of resources are proposed. The study findings provide a theoretical basis for improving the efficiency of the comprehensive transportation network.
本文主要研究多式联运网络中的运输方式和路径联合决策，为货物提供最优方案。本文通过在具有不同运输方式的网络之间设置虚拟连接，构建了多式联运网络系统。采用 Dijkstra 和多目标优化算法来选择网络中的路径。在确定最优路径后，建立路径的时间、成本和风险函数。通过层次分析法设置约束条件，将多目标函数转换为单目标函数。然后，通过梯度下降法对函数进行优化。最后，通过上述算法制定化学品货物的运输计划。结果表明，所提出的算法可以成功地找到复杂网络中运输方式和路径联合决策的解决方案。通过对计划效果进行定量分析，提出了改变初始运输时间和调整资源上限的优化措施。研究结果为提高综合运输网络效率提供了理论依据。
