Demand assignment for express delivery in high-speed railway networks: A passenger train delivery mode

被引：0
|
作者：
Yang X. [1 ]
Kang L. [1 ]
Sun H. [2 ]
Wu J. [2 ]
机构：
[1] Key Laboratory of Transport Industry of Comprehensive Transportation Theory, Beijing Jiaotong University, Beijing
[2] School of Systems Science, Beijing Jiaotong University, Beijing
来源：
Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice | 2024年 / 44卷 / 05期
基金：
中国国家自然科学基金;
关键词：
demand assignment model; express delivery with high-speed railway; nested particle swarm optimization; transportation route; two-phase algorithm;
D O I：
10.12011/SETP2023-0119
中图分类号：
学科分类号：
摘要：
Aiming at the optimization of demand transportation and assignment in the express delivery network with high-speed railway, this paper proposes a two-stage demand assignment method under the passenger train delivery mode. In the first stage, we use the K-shortest algorithm to calculate the set of feasible transportation routes for freight demands. In the second stage, an optimization model for network train demand assignment plan is built by introducing the type of demand transportation path, train loading state and train cross line operation. In addition, due to the complexity of combinatorial optimization problems and the nonlinear and multivariable characteristics of the model, the traditional particle swarm optimization algorithm has low efficiency in solving transportation and assignment plan models under different freight scales. Therefore, this paper proposes an improved nested particle swarm optimization algorithm to improve the efficiency and accuracy of the solution by iteratively optimizing the transportation path and demand assignment plan. Finally, the paper takes the high-speed railway and EMU operating network composed of 10 lines, including Harbin Dalian Railway, Beijing Shenyang Railway, Changchun Baicheng Wulumuqi Railway, etc., as an example to verify the demand assignment model and the effectiveness of the algorithm. The experimental results indicate that the optimization model for the transportation and assignment plan considering the operation of cross-line trains reduces the demand backlog by 5% approximately. In addition, the nested particle swarm optimization algorithm can effectively solve the demand transportation and assignment problem for large-scale high-speed railway networks, and the efficiency of the solution is improved by about 20% compared with the classical algorithm. © 2024 Systems Engineering Society of China. All rights reserved.
引用
收藏
页码：1699 / 1713
页数：14
相关论文
共 18 条
  • [1] Gao R H, Niu H M, Yang X M., Coordinating train timetable and demand assignment for express delivery with high-speed railway with time-dependent-oriented demand, Traffic Information and Safety, 38, 4, pp. 122-131, (2020)
  • [2] Fang Y, Zhang X, Li Y., Research on multicriteria decision-making scheme of high-speed railway express product pricing and slot allocation under competitive conditions, Mathematics, 10, 9, (2022)
  • [3] Luo J Q, Kuang H B, Feng T, Et al., Research on the co-opetition between high speed rail and civil aviation based on two stage game model, Systems Engineering — Theory & Practice, 39, 1, pp. 150-164, (2019)
  • [4] Zhang Y, Guo J, An M., Development of a railway out-of-gauge freight transport routing optimal method, Physica A: Statistical Mechanics and its Applications, 595, (2022)
  • [5] Fan H M, Zhang Y G, Tian P J, Et al., Dynamic vehicle routing problem of heterogeneous fleets with time-dependent networks, Systems Engineering — Theory & Practice, 42, 2, pp. 455-470, (2022)
  • [6] Wu L, Wang S, Laporte G., The robust bulk ship routing problem with batched cargo selection, Transportation Research Part B: Methodological, 143, pp. 124-159, (2021)
  • [7] Brandt F, Nickel S., The air cargo load planning problem — A consolidated problem definition and literature review on related problems, European Journal of Operational Research, 275, 2, pp. 399-410, (2019)
  • [8] Sotelo R, Gatti L, Machin M, Et al., Determination of the optimal distribution for loading cargo vehicles using the IBM Qiskit VQE algorithm, 2021 IEEE URUCON, pp. 435-439, (2021)
  • [9] Zhang C, Wang Q, Yuan G., Novel models and algorithms for location assignment for outbound containers in container terminals, European Journal of Operational Research, 308, 2, pp. 722-737, (2023)
  • [10] Zhang G Y, Yao Y H, Gao Q, Et al., Optimization model and algorithm of balanced loading layout of railway container mixed goods, Journal of Transportation System Engineering and Information Technology, 22, 2, pp. 212-222, (2022)
12