頁籤選單縮合
題名 | Rail Consignment Path Planning Based on Multimodal Transport: Considering the Time Uncertainty Condition= |
---|---|
作者 | Tong, Haolin; |
期刊 | Journal of Engineering, Project, and Production Management |
出版日期 | 20230500 |
卷期 | 13:2 2023.05[民112.05] |
頁次 | 頁104-112 |
分類號 | 557.249 |
語文 | eng |
關鍵詞 | Multimodal transport; Route optimization; Uncertainty conditions; Particle swarm optimization; |
英文摘要 | Multimodal transport has emerged and applied to logistics work as single-mode transport was unable to meet the growing demand for logistics. Due to the difference in cost and time consumption between different modes of transportation, the path planning of multimodal transport is different from that of single-mode transport. This paper firstly established a multimodal railroad consignment path optimization model under the condition of transportation time uncertainty and then optimized the path and transportation mode with the particle swarm optimization (PSO) algorithm according to the path optimization model. In addition, the PSO algorithm was optimized by a genetic algorithm to avoid the optimization process of the PSO algorithm from falling into the locally optimal solution. Finally, simulation experiments were carried out on the improved PSO algorithm, and it was compared with the traditional PSO and genetic algorithms. The results showed that the improved PSO algorithm converged to stability after about 200 iterations, the traditional PSO algorithm converged to stability after about 240 iterations, and the genetic algorithm converged to stability after about 400 iterations; the total transport cost and time of railway transportation were USD 114,300 and 52.5 h; the total transport cost and time of the path obtained by the genetic algorithm were USD 60,400 and 35.6 h; the total transport cost and time of the path obtained by the traditional PSO algorithm were USD 37700 and 24.3 h; the total transport cost and time of the path obtained by the improved PSO algorithm were USD 3,1900 and 23.4 h. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。