Research on a multimodal discrete network design considering the construction of transfer nodes

Journal Information

J. Hefei Univ. Tech. (Nat. Sci.), Jul. 2026, Vol. 49 No. 7: 957-963

DOI: 10.3969/j.issn.1003-5060.2026.07.014

Authors

DING Jianxun $ ^{1} $, WANG Xiaofei $ ^{1} $, FAN Yinchao $ ^{2} $, LONG Jiancheng $ ^{1} $

(1. School of Automobile and Traffic Engineering, Hefei University of Technology, Hefei 230009, China; 2. School of Mathematics, China University of Mining and Technology, Xuzhou 221116, China)

Abstract and Keywords

Abstract: Travelers often employ various modes of transportation to accomplish a complete trip. Among them, park-and-ride facilitates the transition from car travel to public transportation systems. This process necessitates the establishment of designated areas or facilities within the city to enable park-and-ride transfers. Consequently, this paper proposes a multimodal network design problem (NDP) that considers the construction of transfer nodes. A bilevel programming model is constructed, where the upper-level model considers the decision-makers' perspective in planning the placement of park-and-ride facilities, while the lower-level model considers the mode division and traffic allocation problems under the multimodal network. A surrogate-model-based algorithm is presented to solve the aforementioned bilevel programming model, incorporating the self-regulated averaging method (SRAM) and gradient projection (GP) algorithm to address mode splitting and traffic assignment in the lower level. Finally, numerical experiments are conducted on the Sioux Falls network to validate the effectiveness of the algorithm and model. The experimental results demonstrate that the rational placement of park-and-ride facilities can effectively reduce the overall system cost of the urban transportation network. The proposed surrogate-model-based algorithm outperforms genetic algorithms in terms of both efficiency and accuracy.

Keywords: urban traffic; transfer node; surrogate-model-based algorithm; multimodal transport network; bilevel programming

作者信息

丁建勋 $ ^{1} $，王啸飞 $ ^{1} $，樊银超 $ ^{2} $，龙建成 $ ^{1} $

(1. 合肥工业大学汽车与交通工程学院，安徽合肥 230009；2. 中国矿业大学数学学院，江苏徐州 221116)

摘要和关键词

摘要: 出行者进行一次完整的出行往往会通过多种交通模式来实现, 其中停车换乘有效衔接了小汽车出行模式向公共交通模式的转换, 在此过程中需要在城市中设置特定区域或设施以完成停车换乘。文章提出了一个考虑换乘点修建的多模式网络设计问题(network design problem, NDP), 构建了一种双层规划模型, 上层模型从决策者角度考虑换乘停车点修建规划, 下层模型为多模式网络下的模式划分和交通分配问题。通过提出基于代理模型的算法来求解上述双层规划模型, 结合自适应平均法(self-regulated averaging method, SRAM) 和梯度投影(gradient projection, GP) 算法解决下层模式划分与交通分配问题。最后采用 Sioux Falls 网络进行数值算例分析, 验证了算法和模型的有效性。结果表明, 停车换乘点的合理修建能够有效降低城市交通网络的系统总费用, 提出的基于代理模型算法相较遗传算法在效率和精度上更高。

关键词: 城市交通；换乘点；代理模型算法；多模式网络；双层规划

Funding

国家自然科学基金资助项目（71925001；72271079；52472312）

合肥工业大学学报(自然科学版)

Navigation