基于时刻表的高速铁路客流分配分解方法  

Schedule-Based Passenger Flow Assignment Decomposition Method for High-Speed Railway Networks

作　　者：史峰[1] 付碧帆 徐光明[1] SHI Feng;FU Bifan;XU Guangming(School of Traffic and Transportation Engineering,Central South University,Changsha Hunan 410075,China)

机构地区：[1]中南大学交通运输工程学院,湖南长沙410075

出　　处：《中国铁道科学》2020年第6期164-175,共12页China Railway Science

基　　金：国家自然科学基金资助项目(U1934216,71701216,71171200);湖南省自然科学基金资助项目(2020JJ5783)。

摘　　要：基于高速铁路高速度、高密度开行特征,将旅客对高铁出行时刻的需求描述为关于意愿出发时刻的连续时变需求,再按照等时间间隔,将其转化为离散时空需求;基于时刻表构建高铁出行时空网络,在不考虑列车拥挤的情况下,将离散客流高铁均衡分配问题等价于具有列车席位能力约束的多个O-D离散需求的最小费用流问题;构建形成基于时刻表的高铁客流分配线性规划模型,为处理模型巨量的决策变量和约束条件,设计丹齐格-沃尔夫分解算法,将模型分解成基于终点的无能力约束最小费用流问题;利用时空网络无圈特性,完成对大规模网络下高铁客流分配模型的求解,并通过海南环岛铁路东环线实例验证算法。结果表明:对于所有2015年7月1日自三亚站出发的旅客,网络中不存在提前购票附加成本,网络能力较宽松;将网络客流量放大为原客流量的1.8倍,以琼海—海口间14:00出发的3种最优出行方案为例,得到3种方案出行费用均为184.60元,意味着网络达到用户均衡状态,证明模型与算法兼具有效性和高效性。Based on the high-speed and high-frequency operating characteristics of high-speed railways(HSR),the passenger’s demand for travel time is described as the continuous time-varying demand at expected departure time, and the continuous time-varying demand is converted into discrete space-time demand at equal time intervals. HSR time-space network is constructed based on HSR schedule. Without considering train congestion, the equilibrium assignment problem of discrete passenger flow is equivalent to the minimum cost flow problem of multiple OD discrete demands with train seat capacity constraints. A schedule-based linear programming model for HSR passenger flow assignment is constructed. In order to deal with the huge number of decision variables and constraints of the model, the Danzig-Wolfe decomposition algorithm is designed to decompose the model into destination-based minimal cost flow problems with no capacity constraints. Utilizing the acyclic characteristics of HSR time-space networks, the HSR passenger flow assignment model under largescale network is solved, and the algorithm is verified by an example of the East ring of Hainan Roundabout Railway. Results show that: for all passengers departing from Sanya station on July 1 st, 2015, there is no additional cost for purchasing ticket in advance in this network, and the network capacity is relatively loose.When the network passenger flow is 1. 8 times of the original passenger flow, there are three optimal travel routes for passengers with the desired departure time of 14:00 between Qionghai and Haikou. The travel costs of the three routes are all 184. 60 yuan. It means that the network has reached a user equilibrium state, which proves that the model and algorithm are both effective and efficient.

关 键 词：高速铁路 客流分配 时变需求 线性规划模型 D-W分解算法 

分 类 号：U293.1[交通运输工程—交通运输规划与管理]